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
/*
javac e.java && java e
*/

import java.io.*;
import java.util.*;

public class e {
	public static void main(String[] args) { new e(); }
	FS in = new FS();
	PrintWriter out = new PrintWriter(System.out);

	int t;
	int n, m;
	char[] s, p;
	short[][][] dp;
	boolean yes;

	e() {
		t = in.nextInt();
		while (t-- > 0) {
			s = in.next().toCharArray();
			p = in.next().toCharArray();

			n = s.length;
			m = p.length;

			dp = new short[m + 1][m + 1][n];
			for (int i = 0; i < m + 1; i++)
				for (int j = 0; j < m + 1; j++)
					Arrays.fill(dp[i][j], (short) -1);

			yes = false;
			for (int i = m; i >= 0; i--)
				yes |= i <= dp(0, 0, i);
			
			if (yes) out.println("YES");
			else out.println("NO");
		}
		out.close();
	}

	short dp(int i, int j, int k) {
		if (i == n)
			return k == m ? (short) j : (short) -2;
		if (j == m && k == m)
			return (short) j;
		if (dp[j][k][i] != -1)
			return dp[j][k][i];

		short max = (short) -2;
		if (k == m) {
			if (s[i] == p[j]) 
				max = max(max, dp(i + 1, j + 1, k));
			max = max(max, dp(i + 1, j, k));
		}
		else if (j == m) {
			if (s[i] == p[k])
				max = max(max, dp(i + 1, j, k + 1));
			max = max(max, dp(i + 1, j, k));
		}
		else {
			if (s[i] == p[j]) 
				max = max(max, dp(i + 1, j + 1, k));
			if (s[i] == p[k]) 
				max = max(max, dp(i + 1, j, k + 1));
			max = max(max, dp(i + 1, j, k));
		}

		return dp[j][k][i] = max;
	}

	short max(short x, short y) { return x > y ? x : y; }
	
	int abs(int x) { return x < 0 ? -x : x; }
	long abs(long x) { return x < 0 ? -x : x; }
	double abs(double x) { return x < 0 ? -x : x; }
	int min(int x, int y) { return x < y ? x : y; }	
	int max(int x, int y) { return x > y ? x : y; }
	long min(long x, long y) { return x < y ? x : y; }	
	long max(long x, long y) { return x > y ? x : y; }
	double min(double x, double y) { return x < y ? x : y; }
	double max(double x, double y) { return x > y ? x : y; }
	int gcd(int x, int y) { while (y > 0) { x = y^(x^(y = x)); y %= x; } return x; }
	long gcd(long x, long y) { while (y > 0) { x = y^(x^(y = x)); y %= x; } return x; }
	long lcm(int x, int y) { return ((long) x / gcd(x, y)) * y; }
	long lcm(long x, long y) { return (x / gcd(x, y)) * y; }

	void sort(int[] arr) {
		int sz = arr.length, j;
		Random r = new Random();
		for (int i = 0; i < sz; i++) {
			j = r.nextInt(i + 1);
			arr[i] = arr[j]^(arr[i]^(arr[j] = arr[i]));
		} Arrays.sort(arr);
	}

	class FS {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer("");
		String next() {
			while (!st.hasMoreTokens()) {
				try { st = new StringTokenizer(br.readLine()); }
				catch (Exception e) {}
			} return st.nextToken();
		}
		int nextInt() { return Integer.parseInt(next()); }
		long nextLong() { return Long.parseLong(next()); }
		double nextDouble() { return Double.parseDouble(next()); }
	}
}
