Migrated from Lutece 775 Similar strings

All parts of this problem, including description, images, samples, data and checker, might be broken. If you find bugs in this problem, please contact the admins.

Description

We call two strings $S[1\cdots n]$ and $T[1\cdots n]$ similar if and only if:

1. They have the same length $n$.
2. For any pair of index $i$ and $j$, if $S_i=S_j$,then $T_i=T_j$.If $S_i\neq S_j$, then $T_i\neq T_j$ ($\neq$ means not equal to).

For example:

1. $S=$AABBC and $T=$ZZYYK are similar.
2. $S=$AABBC and $T=$ZZYY are not similar. (different length)
3. $S=$AABBC and $T=$ZXYYK are not similar. ($S_1=S_2$,$T_1\neq T_2$).

Now, give you two strings, please tell me whether they are similar.

Input

The first line of input is a number $T$,indicating the number of test case.For each test case,there are two lines,string $S$ and string $T$.Each string only contains upper-case.English letters,at least $1$ letter,at most $10^5$ letters.

Output

For each test case if $S$ and $T$ are similar output YES, otherwise output NO.

Samples

3
AABBC
ZZYYK
AABBC
ZZYY
AABBC
ZXYYK

YES
NO
NO

Resources

第五届ACM趣味程序设计竞赛第四场（正式赛）