XOR and OR

Problem Description

You are given a $01$ sequence $a_1, a_2, \dots, a_n$ of length $n$.

You may perform the following operation any number of times:

• Choose two indices $1 \le i, j \le n$ ($i \ne j$).
• Let $x = a_i \ \mathrm{xor}\ a_j$, $y = a_i \ \mathrm{or}\ a_j$, where $\mathrm{xor}$ denotes bitwise XOR and $\mathrm{or}$ denotes bitwise OR.
• Then set $a_i = x, a_j = y$ or $a_i = y, a_j = x$.

Given two $01$ sequences $s$ and $t$, determine whether you can turn $s$ into $t$ by a finite number (possibly zero) of operations.

Input Format

The first line contains an integer $t$, the number of test cases ($1 \le t \le 10^3$). Then follow $t$ test cases:

For each test case, the first line contains a $01$ string $s$ ($1 \le |s| \le 10^3$), and the second line contains a $01$ string $t$ ($1 \le |t| \le 10^3$).

Note: $|s|$ may not be equal to $|t|$.

Output Format

If $s$ can be turned into $t$ by a finite number (possibly zero) of operations, output YES; otherwise output NO.

Sample Input

2
001
011
11
101

Sample Output

YES
NO

Sample Explanation

For the first test case, choose $i = 2, j = 3$; then $x = 1, y = 1$, and after setting $a_i = x, a_j = y$ we obtain the sequence $t$.

For the second test case, $|s| = 2$ and $|t| = 3$, so the requirement clearly cannot be met.