Problem: You are given three strings s, t and p consisting of lowercase Latin letters. You may perform any number (possibly, zero) operations on these strings.

During each operation you choose any character from p, erase it from p and insert it into string s (you may insert this character anywhere you want: in the beginning of s, in the end or between any two consecutive characters). 

For example, if p is aba, and s is de, then the following outcomes are possible (the character we erase from p and insert into s is highlighted):

  * aba → ba, de → ade; 
  * aba → ba, de → dae; 
  * aba → ba, de → dea; 
  * aba → aa, de → bde; 
  * aba → aa, de → dbe; 
  * aba → aa, de → deb; 
  * aba → ab, de → ade; 
  * aba → ab, de → dae; 
  * aba → ab, de → dea; 



Your goal is to perform several (maybe zero) operations so that s becomes equal to t. Please determine whether it is possible.

Note that you have to answer q independent queries.

Input

The first line contains one integer q (1 ≤ q ≤ 100) — the number of queries. Each query is represented by three consecutive lines.

The first line of each query contains the string s (1 ≤ |s| ≤ 100) consisting of lowercase Latin letters.

The second line of each query contains the string t (1 ≤ |t| ≤ 100) consisting of lowercase Latin letters.

The third line of each query contains the string p (1 ≤ |p| ≤ 100) consisting of lowercase Latin letters.

Output

For each query print YES if it is possible to make s equal to t, and NO otherwise.

You may print every letter in any case you want (so, for example, the strings yEs, yes, Yes and YES will all be recognized as positive answer).

Example

Input


4
ab
acxb
cax
a
aaaa
aaabbcc
a
aaaa
aabbcc
ab
baaa
aaaaa


Output


YES
YES
NO
NO

Note

In the first test case there is the following sequence of operation: 

  1. s =  ab, t =  acxb, p =  cax; 
  2. s =  acb, t =  acxb, p =  ax; 
  3. s =  acxb, t =  acxb, p =  a. 



In the second test case there is the following sequence of operation: 

  1. s =  a, t =  aaaa, p =  aaabbcc; 
  2. s =  aa, t =  aaaa, p =  aabbcc; 
  3. s =  aaa, t =  aaaa, p =  abbcc; 
  4. s =  aaaa, t =  aaaa, p =  bbcc. 

Solution (in JAVA):

Solution:

import java.io.BufferedReader; 
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.StringTokenizer;

public class aasan {

	static class pair {
		long first;
		long second;

		public pair(long first, long second) {
			this.first = first;
			this.second = second;
		}

	}

	static void sort(int[] a) {
		ArrayList<Integer> l = new ArrayList<>();
		for (int i : a)
			l.add(i);
		Collections.sort(l);
		for (int i = 0; i < a.length; i++)
			a[i] = l.get(i);
	}

	static int[] letterCount(String s) {
		int[] arr = new int[26];
		for (int i = 0; i < s.length(); i++) {
			arr[s.charAt(i) - 'a']++;
		}
		return arr;
	}

	public static void main(String[] args) {
		FastReader sc = new FastReader();

		int q = sc.nextInt();
		String s = "";
		String t = "";
		String p = "";
		out: while (q-- > 0) {
			s = sc.nextLine();
			t = sc.nextLine();
			p = sc.nextLine();

			int n = s.length();
			int m = t.length();
			int r = p.length();

			int[][] dp = new int[n + 1][m + 1];

			for (int i = 1; i < n + 1; i++) {
				for (int j = 1; j <= m; j++) {
					if (s.charAt(i - 1) == t.charAt(j - 1)) {
						dp[i][j] = dp[i - 1][j - 1] + 1;
					} else {
						dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
					}
				}
			}

			if (dp[n][m] != n) {
				System.out.println("NO");
				continue;
			}

			int[] count1 = letterCount(s);
			int[] count2 = letterCount(t);
			int[] count3 = letterCount(p);

			for (int i = 0; i < 26; i++) {
				if (count1[i] + count3[i] < count2[i]) {
					System.out.println("NO");
					continue out;
				}
			}
			System.out.println("YES");
		}
	}

	static class multiset {
		final private HashMap<Integer, ArrayList<Integer>> mset = new HashMap<>();

		public void add(int value, int index) {
			if (mset.containsKey(value)) {
				mset.get(value).add(index);
			}
		}

		public int delete(int value) {
			if (mset.containsKey(value)) {
				ArrayList<Integer> arr = mset.get(value);
				int ret = arr.get(arr.size() - 1);
				arr.remove(arr.size() - 1);
				if (arr.size() == 0) {
					mset.remove(value);
				}
				return ret;
			} else {
				return -1;
			}
		}

		public boolean contains(int value) {
			return mset.containsKey(value);
		}
	}

	static class Solver {
		public void solve(long x, long[] cubes, HashSet<Long> set) {

		}
	}

	static class FastReader {
		BufferedReader br;
		StringTokenizer st;

		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

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

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

		long nextLong() {
			return Long.parseLong(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		int[] readArray(int n) {
			int[] a = new int[n];
			for (int i = 0; i < n; i++)
				a[i] = nextInt();
			return a;
		}

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}
	}

}