You are given a string s. You can build new string p from s using the following operation no more than two times: 

  1. choose any subsequence s_{i_1}, s_{i_2}, ..., s_{i_k} where 1 ≤ i_1 < i_2 < ... < i_k ≤ |s|; 
  2. erase the chosen subsequence from s (s can become empty); 
  3. concatenate chosen subsequence to the right of the string p (in other words, p = p + s_{i_1}s_{i_2}... s_{i_k}). 



Of course, initially the string p is empty. 

For example, let s = ababcd. At first, let's choose subsequence s_1 s_4 s_5 = abc — we will get s = bad and p = abc. At second, let's choose s_1 s_2 = ba — we will get s = d and p = abcba. So we can build abcba from ababcd.

Can you build a given string t using the algorithm above?

Input

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.

Output

Print T answers — one per test case. Print YES (case insensitive) if it's possible to build t and NO (case insensitive) otherwise.

Example

Input


4
ababcd
abcba
a
b
defi
fed
xyz
x


Output


YES
NO
NO
YES
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const long long INF = (1e9);
char s[((500) + 5)], p[((500) + 5)];
int dp[((500) + 5)];
bool check(int pn1, int pn2, int sn) {
  memset(dp, -1, sizeof(dp));
  dp[0] = 0;
  for (int i = 1; i <= sn; i++) {
    for (int j = pn1; j >= 0; j--) {
      if (dp[j] >= 0) {
        if (j + 1 <= pn1 && s[i] == p[j + 1]) {
          dp[j + 1] = max(dp[j + 1], dp[j]);
        }
        if (dp[j] + 1 <= pn2 && s[i] == p[pn1 + dp[j] + 1]) {
          dp[j] = max(dp[j], dp[j] + 1);
        }
      }
    }
  }
  return dp[pn1] >= pn2;
}
int main() {
  int t;
  scanf("%d", &t);
  while (t--) {
    scanf("%s%s", s + 1, p + 1);
    int sn = strlen(s + 1), pn = strlen(p + 1);
    int flag = 0;
    for (int i = 0; i < pn; i++) {
      if (check(i, pn - i, sn)) {
        flag = 1;
        break;
      }
    }
    if (flag)
      printf("YES\n");
    else
      printf("NO\n");
  }
  return 0;
}
