Deja vu of Go Players

An ordinary sequence rather than magic codes? Rikka's opinion is much more important than the 'truth' itself. She soon felt sleepy and fell asleep to take a trip to dreamlands in passing.

Rikka found two elders playing Go when her sanity came back. The ethereal clouds, hardy vigorous pines, and rugged rocks shocked her. A fiction isekai! Excited, Rikka's eyes ran around and finally focused on the Go board.

The two players, wearing white and red respectively, were not playing Go. They divided the black and white pieces into piles and took turns removing them. They kept silent in response to her questions, so Rikka had to stand there and keep her eyes on the board.

The game looked unexpectedly simple. The red player starts with $n$ black piles, and the white player starts with $m$ white piles. They take turns removing any positive number of pieces from one of their own piles. Red moves first. The player who first removes all pieces assigned to them wins, and the other player has to drink.

Drinking is illegal for minors in Japan, so Rikka wonders whether she can ensure a win when she is the red player.

The first line contains an integer $T (1\le T \le 100)$, the number of test cases. Then $T$ test cases follow.

Each test case has the following format.

The first line contains two integers $n,m (1\le n,m \le 100)$, the numbers of piles of the red and the white player.

The next line contains $n$ integers $a_i (1 \leq a_i \leq 10^9)$, where each integer is the number of pieces in a black pile of the red player.

The next line contains $m$ integers $b_i (1 \leq b_i \leq 10^9)$, where each integer is the number of pieces in a white pile of the white player.

Output a string in one line: Yes if the red player, who moves first, can ensure a win, or No otherwise.