Encrypted password

Someone built a new encryption algorithm. Assume every password is made of lowercase letters only.

Encryption goes like this.

1. Swap the letters at two different positions of the password. You may skip this step, or repeat it as many times as you want.
2. Add zero or more characters in front of the result of step 1.
3. Add zero or more characters behind the result of step 2.

The result of step 3 is the encrypted password.

Cheongho encrypted every password he used with this algorithm. He did it by hand, so he may have slipped somewhere, and he wants a program that checks whether the encryption came out right.

Given an encrypted password and the original password, decide whether the encrypted password can be the result of encrypting the original password with the algorithm above.

The first line has the number of test cases $T$. ($1 \le T \le 100$)

Each test case takes two lines. The first line holds the encrypted password and the second line holds the original password.

Both strings are made of lowercase letters only, and each has length at least $1$ and at most $100\,000$. The encrypted password is never shorter than the original password.

Print one line per test case. Print YES if encrypting the original password with the algorithm can produce the given encrypted password, and NO if it cannot.