[Solution] Two 0-1 sequences Codeforces Solution

A. Two 0-1 sequences

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

AquaMoon has two binary sequences a$a$ and b$b$, which contain only 0$0$ and 1$1$. AquaMoon can perform the following two operations any number of times (a1$a_1$ is the first element of a$a$, a2$a_2$ is the second element of a$a$, and so on):

• Operation 1: if a$a$ contains at least two elements, change a2$a_2$ to min(a1,a2)$\min (a_1,a_2)$, and remove the first element of a$a$.
• Operation 2: if a$a$ contains at least two elements, change a2$a_2$ to max(a1,a2)$\max (a_1,a_2)$, and remove the first element of a$a$.

Note that after a removal of the first element of a$a$, the former a2$a_2$ becomes the first element of a$a$, the former a3$a_3$ becomes the second element of a$a$ and so on, and the length of a$a$ reduces by one.

Determine if AquaMoon can make a$a$ equal to b$b$ by using these operations.

Input

The first line contains a single integer t$t$ (1≤t≤2000$1\le t\le 2000$) — the number of test cases. Description of test cases follows.

The first line of each test case contains two integers n$n$, m$m$ (1≤n,m≤50$1\le n,m\le 50$, m≤n$m\le n$) — the lengths of a$a$ and b$b$ respectively.

The second line of each test case contains a string a$a$ of length n$n$, consisting only 0$0$ and 1$1$.

The third line of each test case contains a string b$b$ of length m$m$, consisting only 0$0$ and 1$1$.

Output

For each test case, output "YES" if AquaMoon can change a$a$ to b$b$ by using these options; otherwise, output "NO".

You may print each letter in any case (for example, "YES", "Yes", "yes", "yEs" will all be recognized as a positive answer).