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
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        EEraseSubsequences solver = new EEraseSubsequences();
        solver.solve(1, in, out);
        out.close();
    }

    static class EEraseSubsequences {
        char[] arr;
        char[] match;
        int[][][] memo;

        public void solve(int testNumber, Scanner sc, PrintWriter pw) {
            int q = sc.nextInt();
            loop:
            while (q-- > 0) {
                arr = sc.next().toCharArray();
                match = sc.next().toCharArray();
                memo = new int[match.length + 1][match.length + 1][arr.length + 1];
                for (int[][] x : memo)
                    for (int[] y : x)
                        Arrays.fill(y, -1);
                for (int i = 0; i < match.length; i++) {
                    if (dp(0, i, 0) >= i) {
                        pw.println("YES");
                        continue loop;
                    }
                }
                pw.println("NO");
            }
        }

        private int dp(int i, int j, int idx) {
            if (idx == arr.length) {
                return j == match.length ? 0 : (int) -1e9;
            }
            if (memo[i][j][idx] != -1)
                return memo[i][j][idx];
            int x = (int) -1e9, y = (int) -1e9;
            if (i < match.length && match[i] == arr[idx]) {
                x = 1 + dp(i + 1, j, idx + 1);
            }
            if (j < match.length && match[j] == arr[idx]) {
                y = dp(i, j + 1, idx + 1);
            }
            int leave = dp(i, j, idx + 1);
            return memo[i][j][idx] = Math.max(x, Math.max(y, leave));
        }

    }

    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(FileReader r) {
            br = new BufferedReader(r);
        }

        public Scanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        public String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}

