SPOJ Problem Set (classical) 3. Substring Check (Bug Funny) Problem code: SBSTR1

Given two binary strings, A (of length 10) and B (of length 5), output 1 if B is a substring of A and 0 otherwise.

Please note, that the solution may only be submitted in the following languages: Brainf**k, Whitespace and Intercal.

Input

24 lines consisting of pairs of binary strings A and B separated by a single space.

Output

The logical value of: 'B is a substring of A'.

Example

First two lines of input:

1010110010 10110
1110111011 10011

First two lines of output:
1
0

---

Added by:	Adrian Kosowski
Date:	2004-05-01
Time limit:	7s
Source limit:	50000B
Languages:	BF ICK WSPC