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.
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.
Print "Yes" if the sequence contains the favorite sequence in it, otherwise print "No".
All the characters are lowercase alphabets.