Challenges

SwapMaster solves Symmetric Swap
The SwapMaster is known to be the greatest and fastest swapper of all ...
Max. Marks: 4
Solved By : 1957
String Matching
Cody has a sequence of characters N. He likes a sequence if it contain...
Max. Marks: 3
Solved By : 914
Leap Year
Steve is playing a quiz game with his brother John. As Steve just lear...
Max. Marks: 6
Solved By : 1565
Project Teams
There are N students in a class and Teacher want to divide these stude...
Max. Marks: 5
Solved By : 2709
Circle of Numbers
All numbers in NumberLand are standing in a circle for a dancing cerem...
Max. Marks: 6
Solved By : 1923
Happy String
A happy string is a string in which each character is lexicographicall...
Max. Marks: 4
Solved By : 1373
Degree Celsius
Tom is a scientist. He uses huge machines for complex calculations. Th...
Max. Marks: 4
Solved By : 3208
Three's Company
This problem requires you to create a output string from input string ...
Max. Marks: 4
Solved By : 2252
Array Sum
You are given an integer array and you have to find the sum of the ele...
Max. Marks: 4
Solved By : 2154
Change in Case
You will be given a single string and two positive integers denoting i...
Max. Marks: 6
Solved By : 1188
String Matching
Please select a challenge
Problem Statement
Cody has a sequence of characters N. He likes a sequence if it contains his favourite sequence as a substring. Given the sequence and his favourite sequence F, check whether the favourite sequence is present in the sequence.

Input
The first line of input contains a single line T, which represents the number of test cases. Each test case consists of 2 strings separated by space N and F respectively.

Output
Print "Yes" if the sequence contains the favorite sequence in it, otherwise print "No".

Constraints
1<=T<=10. 1<=|N|,|F|<=100. All the characters are lowercase alphabets.

Sample Input
2
abcde abc
pqrst pr

Sample Output

Yes
No

Dcoded By: Bhanu Nadar

Solved By: 914

Maximum Marks: 3