Three Strings

题意翻译

第一行输入$T$,表示数据组数。 每个数据输入三个字符串$a，b， c$，长度相等。 对于每个下标i,你必须将$a_i$或$b_i$与$c_i$交换，问最后字符串$a$是否可能等于$b$。

题目描述

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 \leq i \leq 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 \leftrightarrow a_i $ or $ c_i \leftrightarrow 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 $ ?

输入输出格式

输入格式

The input consists of multiple test cases. The first line contains a single integer $ t $ ( $ 1 \leq t \leq 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 $ .

输出格式

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.

输入输出样例

输入样例 #1

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

输出样例 #1

NO
YES
YES
NO

说明

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 $ .