CF1709A.Three Doors

There are three doors in front of you, numbered from $1$ to $3$ from left to right. Each door has a lock on it, which can only be opened with a key with the same number on it as the number on the door.

There are three keys — one for each door. Two of them are hidden behind the doors, so that there is no more than one key behind each door. So two doors have one key behind them, one door doesn't have a key behind it. To obtain a key hidden behind a door, you should first unlock that door. The remaining key is in your hands.

Can you open all the doors?

你面前有三扇门，从左到右依次编号为 $1$ 到 $3$。每扇门上都有一把锁，只能用与门编号相同的钥匙才能打开。

共有三把钥匙——每扇门各对应一把。其中两把钥匙被藏在门后，且每扇门后至多藏有一把钥匙。因此，有两扇门后各藏有一把钥匙，一扇门后没有钥匙。若要取得藏在某扇门后的钥匙，你必须先打开那扇门。剩下的那一把钥匙在你手中。

你能否打开所有门？

The first line contains a single integer $t$ ($1 \le t \le 18$) — the number of testcases.

The first line of each testcase contains a single integer $x$ ($1 \le x \le 3$) — the number on the key in your hands.

The second line contains three integers $a, b$ and $c$ ($0 \le a, b, c \le 3$) — the number on the key behind each of the doors. If there is no key behind the door, the number is equal to $0$.

Values $1, 2$ and $3$ appear exactly once among $x, a, b$ and $c$.

第一行包含一个整数 $t$（$1 \le t \le 18$）—— 测试用例的数量。

每个测试用例的第一行包含一个整数 $x$（$1 \le x \le 3$）—— 你手中钥匙上的数字。

每个测试用例的第二行包含三个整数 $a, b$ 和 $c$（$0 \le a, b, c \le 3$）—— 每扇门后钥匙上的数字。若某扇门后没有钥匙，则对应数字为 $0$。

在 $x, a, b$ 和 $c$ 中，数字 $1, 2$ 和 $3$ 恰好各出现一次。

For each testcase, print "YES" if you can open all the doors. Otherwise, print "NO".

对于每个测试用例，如果可以打开所有门，则输出 "YES"；否则，输出 "NO"。