Anyone Can Solve It

Geonmo has been playing with a sequence and decided to turn it into a game.

The game goes as follows.

1. Geonmo starts with sequence $A$.
2. Geonmo appends a number of his choice from $1$ to $9$ to the end of the sequence. However, if the number to append is even, he must first sort the last three numbers of the sequence in ascending order, and then append the number.
3. If Geonmo can build sequence $B$, he wins the game. If he cannot build it no matter what, he loses.

Geonmo lives by the motto 'if you try, you can do it,' but he will not even attempt something that is impossible.

Print whether Geonmo wins the game.

The first line contains the number of test cases $T$. ($1 \le T \le 5\,000$)

Each test case starts with a line containing $N$ and $M$, the lengths of sequence $A$ and sequence $B$, separated by a space. ($3 \le N \le M \le 5\,000$)

The second line of each test case contains $A_1, A_2, \cdots, A_N$, separated by spaces. ($1 \le A_i \le 9$)

The third line of each test case contains $B_1, B_2, \cdots, B_M$, separated by spaces. ($1 \le B_i \le 9$)

The sum of $M$ over all test cases does not exceed $15\,000$.

All numbers are integers.

For each test case, print the answer on its own line. Print YES if Geonmo wins and NO if he loses. Letter case does not matter, so yEs, yes, and YES are all accepted.