Substring Search

Time limit: 5000ms
Memory limit: 256mb

Description:
Check whether the first input string is a substring of the second input string.

Input:
Two strings (of length < 100)

Output:
print 'Y' if the first input string is a substring of second input string; Otherwise, print 'N'.

Sample input:
abc
efabcf

Sample output:
Y
Submit