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 int N = 410;
int dp[N][N];
int nxt[N][N];
char s[N], t[N];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int T;
  cin >> T;
  while (T--) {
    memset(dp, 0, sizeof(dp));
    cin >> s + 1;
    cin >> t + 1;
    int n = strlen(s + 1);
    int m = strlen(t + 1);
    for (int i = 0; i < 26; ++i) nxt[n][i] = n + 1;
    for (int i = n - 1; ~i; --i) {
      for (int j = 0; j < 26; ++j) nxt[i][j] = nxt[i + 1][j];
      nxt[i][s[i + 1] - 'a'] = i + 1;
    }
    bool flag = 0;
    for (int st = 1; st <= m; ++st) {
      for (int i = 0; i <= m; ++i) {
        for (int j = 0; j <= m; ++j) dp[i][j] = n + 1;
      }
      dp[0][st - 1] = 0;
      for (int i = 0; i < st; ++i) {
        for (int j = st - 1; j <= m; ++j) {
          if (dp[i][j] == n + 1) continue;
          if (i != st - 1)
            dp[i + 1][j] = min(dp[i + 1][j], nxt[dp[i][j]][t[i + 1] - 'a']);
          if (j != m)
            dp[i][j + 1] = min(dp[i][j + 1], nxt[dp[i][j]][t[j + 1] - 'a']);
        }
      }
      if (dp[st - 1][m] <= n) {
        flag = 1;
        break;
      }
    }
    puts(flag ? "YES" : "NO");
  }
}
