You are given three strings a, b and c of the same length n. The strings consist of lowercase English letters only. The i-th letter of a is a_i, the i-th letter of b is b_i, the i-th letter of c is c_i.

For every i (1 ≤ i ≤ n) you must swap (i.e. exchange) c_i with either a_i or b_i. So in total you'll perform exactly n swap operations, each of them either c_i ↔ a_i or c_i ↔ b_i (i iterates over all integers between 1 and n, inclusive).

For example, if a is "code", b is "true", and c is "help", you can make c equal to "crue" taking the 1-st and the 4-th letters from a and the others from b. In this way a becomes "hodp" and b becomes "tele".

Is it possible that after these swaps the string a becomes exactly the same as the string b?

Input

The input consists of multiple test cases. The first line contains a single integer t (1 ≤ t ≤ 100) — the number of test cases. The description of the test cases follows.

The first line of each test case contains a string of lowercase English letters a.

The second line of each test case contains a string of lowercase English letters b.

The third line of each test case contains a string of lowercase English letters c.

It is guaranteed that in each test case these three strings are non-empty and have the same length, which is not exceeding 100.

Output

Print t lines with answers for all test cases. For each test case:

If it is possible to make string a equal to string b print "YES" (without quotes), otherwise print "NO" (without quotes).

You can print either lowercase or uppercase letters in the answers.

Example

Input


4
aaa
bbb
ccc
abc
bca
bca
aabb
bbaa
baba
imi
mii
iim


Output


NO
YES
YES
NO

Note

In the first test case, it is impossible to do the swaps so that string a becomes exactly the same as string b.

In the second test case, you should swap c_i with a_i for all possible i. After the swaps a becomes "bca", b becomes "bca" and c becomes "abc". Here the strings a and b are equal.

In the third test case, you should swap c_1 with a_1, c_2 with b_2, c_3 with b_3 and c_4 with a_4. Then string a becomes "baba", string b becomes "baba" and string c becomes "abab". Here the strings a and b are equal.

In the fourth test case, it is impossible to do the swaps so that string a becomes exactly the same as string b.
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.Writer;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.*;
import java.io.*;
import java.math.*;
public class Main7
{
	static class Pair
	{ 
		int x;
		int y;
		int z;
		int p;
		public Pair(int x, int y,int z, int p) 
		{     
			this.x=x;
			this.y=y;
			this.z=z;
			this.p=p;
		}
		    
   /* @Override
            public int hashCode() 
            { 
                final int temp = 14; 
                int ans = 1; 
                ans =x*31+y*13; 
                return ans; 
            } 
      
            // Equal objects must produce the same 
            // hash code as long as they are equal 
        @Override
        public boolean equals(Object o) 
        { 
            if (this == o) { 
                return true; 
            } 
            if (o == null) { 
                return false; 
            } 
            if (this.getClass() != o.getClass()) { 
                return false; 
            } 
            Pair other = (Pair)o; 
            if (this.x != other.x || this.y!=other.y) { 
                return false; 
            } 
            return true; 
        }*/
	} 
	static class Pair1
	{
		int x;
		int y;
		long z;
		Pair1(int x, int y, long z)
		{
			this.x=x;
			this.y=y;
			this.z=z;
		}
	}
    public static long pow(long a, long b)
    {
        long result=1;
        while(b>0)
        {
            if (b % 2 != 0)
            {
                result=(result*a);
                b--;
            } 
            a=(a*a);
            b /= 2;
        }   
        return result;
    }
    public static long fact(long num)
    {
		long value=1;
		int i=0;
		for(i=2;i<num;i++)
		{
			value=((value%mod)*i%mod)%mod;
		}
		return value;
	}
	public static long gcd(long a, long b)
	{
		if (a == 0)
			return b;
		return gcd(b%a, a);
	}	
	public static long lcm(long a,long b)
	{
		return a * (b / gcd(a, b));
	}
/*   public static void dfs(int parent,boolean[] visited,int[] dp)
	{
		ArrayList<Integer> arr=new ArrayList<Integer>();
		arr=graph.get(parent);
		visited[parent]=true;
		for(int i=0;i<arr.size();i++)
		{
			int num=(int)arr.get(i);
			if(visited[num]==false)
			{
				dfs(num,visited,dp);
			}
			dp[parent]=Math.max(dp[num]+1,dp[parent]);
		}
	}
//  static int flag1=0;
	static int[] dis;*/
	static int mod=1000000007;
	static ArrayList<ArrayList<Integer>> graph;
	static ArrayList<ArrayList<Integer>> g;
/*    public static void bfs(int num,int size)
	{
		boolean[] visited=new boolean[size+1];
		Queue<Integer> q=new LinkedList<>();
		q.add(num);
		ans[num]=1;
		visited[num]=true;
		while(!q.isEmpty())
		{
			int x=q.poll();
			ArrayList<Integer> al=graph.get(x);
			for(int i=0;i<al.size();i++)
			{
				int y=al.get(i);    
				if(visited[y]==false)
				{
					q.add(y);
					ans[y]=ans[x]+1;
					visited[y]=true;
				}
			}
		}
	}
	static int[] ans;*/
	public static int[] sort(int[] a)
	{
		int n=a.length;
		ArrayList<Integer> ar=new ArrayList<>();
		for(int i=0;i<a.length;i++)
		{
			ar.add(a[i]);
		}
		Collections.sort(ar);
		for(int i=0;i<n;i++)
		{
			a[i]=ar.get(i);
		}
		return a;
	}
	static int find(int num)
	{
		if(parent[num]!=num)
		{
			parent[num]=find(parent[num]);
		}
		return parent[num];
	} 
	static void union(int x , int y ) 
	{ 
		int xroot = find(x); 
		int yroot = find(y); 
	  
		if (rank[xroot] < rank[yroot]) 
		{
			parent[xroot] = yroot; 
			size[yroot]+=size[xroot];
			size[xroot]=size[yroot];
		}
		else if (rank[yroot] < rank[xroot]) 
		{
			parent[yroot] = xroot; 
			size[xroot]+=size[yroot];
			size[yroot]=size[xroot];
		}
		else
		{ 
			parent[xroot] = yroot; 
			rank[yroot]++; 
			size[yroot]+=size[xroot];
			size[xroot]=size[yroot];
		} 
	} 
	static int[] parent;
	static int[] rank;
	static int[] size;
	static public void main(String args[])throws IOException
	{
		int tt=i();
		while(tt-->0)
		{
			String a=s();
			String b=s();
			String c=s();
			char[] ch=a.toCharArray();
			char[] ch1=b.toCharArray();
			int flag=0;
			for(int i=0;i<a.length();i++)
			{
				if(ch[i]!=ch1[i])
				{
					if(ch[i]==c.charAt(i) || ch1[i]==c.charAt(i))
					{
						
					}
					else
					{
						flag=1;
						break;
					}
				}
				else
				{
					if(ch[i]!=c.charAt(i))
					{
						flag=1;
						break;
					}
				}
			}
			if(flag==1)
			{
				pln("NO");
			}
			else
				pln("YES");
		}
		//System.out.print(sb.toString());
	} 
			/**/
	static InputReader in=new InputReader(System.in);
	static OutputWriter out=new OutputWriter(System.out);
	public static long l()
	{
		String s=in.String();
		return Long.parseLong(s);
	}
	public static void pln(String value)
	{
		System.out.println(value);
	}
	public static int i()
	{
		return in.Int();
	}
	public static String s()
	{
		return in.String();
	}
}
	class InputReader 
	{
		private InputStream stream;
		private byte[] buf = new byte[1024];
		private int curChar;
		private int numChars;
		private SpaceCharFilter filter;
	 
		public InputReader(InputStream stream) {
			this.stream = stream;
		}
	 
		public int read() {
			if (numChars== -1)
				throw new InputMismatchException();
			if (curChar >= numChars) {
				curChar = 0;
				try {
					numChars = stream.read(buf);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (numChars <= 0)
					return -1;
			}
			return buf[curChar++];
		}
	 
		public int Int() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = read();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res *= 10;
				res += c - '0';
				c = read();
			} while (!isSpaceChar(c));
			return res * sgn;
		}
	 
		public String String() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isSpaceChar(c));
			return res.toString();
		}
	 
		public boolean isSpaceChar(int c) {
			if (filter != null)
				return filter.isSpaceChar(c);
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}
	 
		public String next() {
			return String();
		}
	 
		public interface SpaceCharFilter {
			public boolean isSpaceChar(int ch);
		}
	}
	 
	class OutputWriter {
		private final PrintWriter writer;
	 
		public OutputWriter(OutputStream outputStream) {
			writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
		}
	 
		public OutputWriter(Writer writer) {
			this.writer = new PrintWriter(writer);
		}
	 
		public void print(Object...objects) {
			for (int i = 0; i < objects.length; i++) {
				if (i != 0)
					writer.print(' ');
				writer.print(objects[i]);
			}
		}
	 
		public void printLine(Object...objects) {
			print(objects);
			writer.println();
		}
	 
		public void close() {
			writer.close();
		}
	 
		public void flush() {
			writer.flush();
		}
	 
		}
	 
		class IOUtils {
	 
		public static int[] readIntArray(InputReader in, int size) {
			int[] array = new int[size];
			for (int i = 0; i < size; i++)
				array[i] = in.Int();
			return array;
		}
	 
	} 

