B"You are given a string s . You can build new string p from s using the following operation no more than two times: Of course, initially the string p is empty. For example, let s = text{ababcd} . At first, let's choose subsequence s_1 s_4 s_5 = text{abc} -- we will get s = text{bad} and p = text{abc} . At second, let's choose s_1 s_2 = text{ba} -- we will get s = text{d} and p = text{abcba} . So we can build text{abcba} from text{ababcd} . Can you build a given string t using the algorithm above? The first line contains the single integer T ( 1 <= T <= 100 ) -- the number of test cases. Next 2T lines contain test cases -- two per test case. The first line contains string s consisting of lowercase Latin letters ( 1 <= |s| <= 400 ) -- the initial string. The second line contains string t consisting of lowercase Latin letters ( 1 <= |t| <= |s| ) -- the string you'd like to build. It's guaranteed that the total length of strings s doesn't exceed 400 . Print T answers -- one per test case. Print YES (case insensitive) if it's possible to build t and NO (case insensitive) otherwise. "...