Contests | Virtual Contests | Problems | Submit | Runs Status | Rank List | Forum |

Time Limit: 0.5 Seconds Memory Limit: 65536K

Total Runs: 4231 Accepted Runs: 2175

Given a string *s* of length *n*, a subsequence of it, is defined as
another string *s*' = *s*_{u1}
+ *s*_{u2} ... *s*_{um}
where 1 ≤ *u*_{1} < *u*_{2} < ... < *u*_{m}
≤ *n* and *s*_{i} is the *i*th character of *s*.
Your task is to write a program that, given two
strings *s*1 and *s*2, checks whether either *s*2
or its reverse is a subsequence of *s*1 or not.
### Input

### Output

### Sample Input

### Sample Output

The first line of input contains an integer *T*, which is the number of test cases.
Each of the next *T* lines contains two non-empty strings *s*1 and *s*2
(with length at most 100) consisted of only *alpha-numeric* characters and separated
from each other by a single space.

For each test case, your program must output “YES”, in a single line,
if either *s*2 or its reverse is a subsequence of *s*1.
Otherwise your program should write “NO”.

5 arash aah arash hsr kick kkc A a a12340b b31

YES YES NO NO YES

Maintance:Fxz. Developer: SuperHacker, G.D.Retop, Fxz