Bob is playing Hide and Seek with alphabets and he is amazed by the properties of '?' and '*' in the language. He is given a language 'L'. He has to check whether the given string 'S' is present in the language 'L'. He needs your help. Print "Yes" if S is present in L, else print "No".

Definition for L :

• L consists of 28 characters, a-z and '?' and '*'.
• ? denotes 0 or 1 character(s).
• * denotes 0 or any number of characters.

Example:

• String "adb" is present in language L = {a?b}
• String "adb" is present in language L = {a*b}
• String "ab" is present in language L = {a?*b*}

Input

First line of input consists of T (T<=50). Every test case consists of two strings, first line consists of 'L' and second line consists of 'S'. L consists characters among the 28 characters 'a'-'z', '?', '*' only. S consists of only lower case letters.

Output

Print "Yes" if String 'S' is present in language 'L', else print "No".

Example

Input:
5
a?b
acb
a?b
abbb
a*b
abbbb
a*b
asbdfuisdhfsbdfsdfb
abb
bb

Output:
Yes
No
Yes
Yes
No