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.*;
import java.util.*;

public class Problem_E {
	static final int INF = Integer.MAX_VALUE / 2;

	public static void main(String[] args) {
		InputReader in = new InputReader();
		StringBuilder out = new StringBuilder();

		int T = in.nextInt();
		int[][] dp = new int[401][401];
		int[][] next = new int[401][26];
		while (T-- > 0) {
			char[] S = (" " + in.nextLine()).toCharArray();
			char[] P = (" " + in.nextLine()).toCharArray();
			Arrays.fill(next[S.length - 1], INF);
			for (int i = S.length - 2; i >= 0; i--) {
				for (int j = 0; j < 26; j++) {
					next[i][j] = next[i + 1][j];
				}
				next[i][S[i + 1] - 97] = i + 1;
			}
			boolean flag = false;
			for (int i = 1; i < P.length; i++) {
				for (int j = 0; j <= i; j++) {
					Arrays.fill(dp[j], INF);
				}
				dp[0][0] = 0;
				for (int j = 0; j <= i; j++) {
					for (int k = 0; k < P.length - i; k++) {
						if (j > 0) {
							int x = P[j] - 97;
							int y = dp[j - 1][k];
							if (y < INF) {
								dp[j][k] = Math.min(dp[j][k], next[dp[j - 1][k]][x]);
							}
						}
						if (k > 0) {
							int x = P[i + k] - 97;
							int y = dp[j][k - 1];
							if (y < INF) {
								dp[j][k] = Math.min(dp[j][k], next[dp[j][k - 1]][x]);
							}
						}
					}
				}
				if (dp[i][P.length - i - 1] < INF) {
					flag = true;
					break;
				}
			}
			out.append(flag ? "YES\n" : "NO\n");
		}

		System.out.print(out);
	}

	static class InputReader {
		public BufferedReader reader;
		public StringTokenizer st;

		public InputReader() {
			reader = new BufferedReader(new InputStreamReader(System.in));
		}

		public String next() {
			while (st == null || !st.hasMoreTokens()) {
				st = new StringTokenizer(nextLine());
			}
			return st.nextToken();
		}

		public String nextLine() {
			try {
				return reader.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return null;
		}

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