Not waisting much of your time, Lets get to the question straight:

you have been given a string A containing of only 0's and 1's.

An operation is performed on string A.

The operation is described as:
two adjacent character (let it be x and y) is picked fron string A.
Characters 'p' and 'q' are formed using 'x' and 'y' as

p = x bitwise_xor y
q = x bitwise_or y

p replaces one among x and y, and q replaces the other one, in the original string to form a new string.

For example:
if A=11
and, if x=1 and y=1
then,
p= 1 xor 1 = 0
q= 1 or 1 = 1

so, string A now can be either 10 or 01.
The above operation can be applied on a string any number of times.

INPUT :
first line of input contains an integer T(number of test cases).
In each test case you will be provided with two strings, A and B comprising of only 0's and 1's.
each test case will be separated by a blank line.

OUTPUT :
if with any number of operation(maybe 0), we can form string B from string A.
print "YES", otherwise print "NO" on a separate line.

CONSTRAINTS:
T <= 1500
length of A <= 100
length of B = length of A

SAMPLE INPUT:
2
11
10

000
101

SAMPLE OUTPUT:
YES
NO

Problem Setter: Sumit Kumar

Languages: Brain,C,C++,Java,C#,JavaScript,Pascal,Perl,PHP,Python,Ruby,Text

Time Limit: 1 Second(s)
Score: 100 Point(s)
Input File Limit: 50000 Bytes

Mode Judge

RankNameScore
1xyz0
2Ams0
3TIP0
4team420
5xyzz0
6asdasdasd0
7abcd0
8khankhan0
9Gabriel0
10gigel0