CF1270A.Card Game

Two players decided to play one interesting card game.

There is a deck of $n$ cards, with values from $1$ to $n$. The values of cards are pairwise different (this means that no two different cards have equal values). At the beginning of the game, the deck is completely distributed between players such that each player has at least one card.

The game goes as follows: on each turn, each player chooses one of their cards (whichever they want) and puts on the table, so that the other player doesn't see which card they chose. After that, both cards are revealed, and the player, value of whose card was larger, takes both cards in his hand. Note that as all cards have different values, one of the cards will be strictly larger than the other one. Every card may be played any amount of times. The player loses if he doesn't have any cards.

For example, suppose that $n = 5$, the first player has cards with values $2$ and $3$, and the second player has cards with values $1$, $4$, $5$. Then one possible flow of the game is:

• The first player chooses the card $3$. The second player chooses the card $1$. As $3 \gt 1$, the first player gets both cards. Now the first player has cards $1$, $2$, $3$, the second player has cards $4$, $5$.

• The first player chooses the card $3$. The second player chooses the card $4$. As $3 \lt 4$, the second player gets both cards. Now the first player has cards $1$, $2$. The second player has cards $3$, $4$, $5$.

• The first player chooses the card $1$. The second player chooses the card $3$. As $1 \lt 3$, the second player gets both cards. Now the first player has only the card $2$. The second player has cards $1$, $3$, $4$, $5$.

• The first player chooses the card $2$. The second player chooses the card $4$. As $2 \lt 4$, the second player gets both cards. Now the first player is out of cards and loses. Therefore, the second player wins.

Who will win if both players are playing optimally? It can be shown that one of the players has a winning strategy.

两名玩家决定玩一个有趣的纸牌游戏。

一副牌共有 $n$ 张，牌面值为 $1$ 到 $n$。所有牌的面值互不相同（即任意两张不同的牌面值均不相等）。游戏开始时，整副牌被完全分发给两名玩家，且每位玩家至少持有一张牌。

游戏规则如下：每一轮中，双方各自从自己手中的牌中任选一张（可任意选择）置于桌面，对方无法看到所选的是哪张牌；随后双方同时亮出所选牌。面值较大的一方将这两张牌全部收归己手。注意，由于所有牌面值互异，故每轮必有一张牌严格大于另一张。每张牌可被重复使用任意多次。若某位玩家手中无牌，则立即判负。

例如，假设 $n = 5$，第一位玩家持有面值为 $2$ 和 $3$ 的牌，第二位玩家持有面值为 $1$、$4$、$5$ 的牌。则游戏的一种可能进行过程如下：

• 第一位玩家选择牌 $3$，第二位玩家选择牌 $1$。由于 $3 \gt 1$，第一位玩家获得两张牌。此时第一位玩家持有牌 $1$、$2$、$3$，第二位玩家持有牌 $4$、$5$。

• 第一位玩家选择牌 $3$，第二位玩家选择牌 $4$。由于 $3 \lt 4$，第二位玩家获得两张牌。此时第一位玩家持有牌 $1$、$2$，第二位玩家持有牌 $3$、$4$、$5$。

• 第一位玩家选择牌 $1$，第二位玩家选择牌 $3$。由于 $1 \lt 3$，第二位玩家获得两张牌。此时第一位玩家仅剩牌 $2$，第二位玩家持有牌 $1$、$3$、$4$、$5$。

• 第一位玩家选择牌 $2$，第二位玩家选择牌 $4$。由于 $2 \lt 4$，第二位玩家获得两张牌。此时第一位玩家已无牌，判负。因此第二位玩家获胜。

若双方均以最优策略进行游戏，谁将获胜？可以证明，其中一方必有必胜策略。

Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1 \le t \le 100$). The description of the test cases follows.

The first line of each test case contains three integers $n$, $k_1$, $k_2$ ($2 \le n \le 100, 1 \le k_1 \le n - 1, 1 \le k_2 \le n - 1, k_1 + k_2 = n$) — the number of cards, number of cards owned by the first player and second player correspondingly.

The second line of each test case contains $k_1$ integers $a_1, \dots, a_{k_1}$ ($1 \le a_i \le n$) — the values of cards of the first player.

The third line of each test case contains $k_2$ integers $b_1, \dots, b_{k_2}$ ($1 \le b_i \le n$) — the values of cards of the second player.

It is guaranteed that the values of all cards are different.

每个测试包含多个测试用例。第一行包含测试用例的数量 $t$（$1 \le t \le 100$）。随后是各测试用例的描述。

每个测试用例的第一行包含三个整数 $n$、$k_1$、$k_2$（$2 \le n \le 100$，$1 \le k_1 \le n - 1$，$1 \le k_2 \le n - 1$，且满足 $k_1 + k_2 = n$），分别表示卡片总数、第一位玩家拥有的卡片数以及第二位玩家拥有的卡片数。

每个测试用例的第二行包含 $k_1$ 个整数 $a_1, \dots, a_{k_1}$（$1 \le a_i \le n$），表示第一位玩家所持卡片的数值。

每个测试用例的第三行包含 $k_2$ 个整数 $b_1, \dots, b_{k_2}$（$1 \le b_i \le n$），表示第二位玩家所持卡片的数值。

保证所有卡片的数值互不相同。

For each test case, output "YES" in a separate line, if the first player wins. Otherwise, output "NO" in a separate line. You can print each letter in any case (upper or lower).

对于每个测试用例，若先手玩家获胜，则在单独一行输出 “YES”；否则，在单独一行输出 “NO”。每个字母可使用大写或小写形式。

In the first test case of the example, there is only one possible move for every player: the first player will put $2$, the second player will put $1$. $2 \gt 1$, so the first player will get both cards and will win.

In the second test case of the example, it can be shown that it is the second player who has a winning strategy. One possible flow of the game is illustrated in the statement.

在示例的第一个测试用例中，每位玩家都只有一种可能的走法：先手玩家出 $2$，后手玩家出 $1$。由于 $2 \gt 1$，先手玩家将赢得这两张牌并获胜。

在示例的第二个测试用例中，可以证明后手玩家拥有必胜策略。游戏中一种可能的进行过程已在题目陈述中图示说明。