Hidden Secret!

1 seconds
64 MB
Medium
LOJ-1338 Udebug Debug
English

In this problem, you are given two names, you have to find whether one name is hidden into another. The restrictions are:

  1. You can change some uppercase letters to lower case and vice versa.
  2. You can add/remove spaces freely.
  3. You can permute the letters.

And if both the names match exactly, then you can say that one name is hidden into another.

Input

Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case starts with two lines. Each line contains a name consists of upper/lower case English letters and spaces. You can assume that the length of any name is between 1 and 100(inclusive).

Output

For each case, print the case number and Yes if one name is hidden into another. Otherwise print No.

Sample

Sample Input Sample Output

3 Tom Marvolo Riddle I am Lord Voldemort I am not Harry Potter Hi Pretty Roar to man Harry and Voldemort Tom and Jerry and Harry

Case 1: Yes Case 2: Yes Case 3: No