You are given two strings S and T consisting of lower case Latin letters. Your task is to determine if you can make S equal to T using the following operation:
Note: It is necessary to swap both the strings and it is not optional if you are applying operation.
Input format
Output format
Print T lines. For each test case:
Constraints
1≤T≤20000
1≤|S|=|T|≤200000
The sum of |S| over all test cases is less than or equal to 5×105.
First Sample:
Similarly follow other samples