Watermelon Snatch

Problem Description

There are $t$ players. The $i$-th player holds a card with $n_i$ integers written on it, namely $m_1, m_2, \dots, m_{n_i}$.

The host draws balls from a bag one by one and announces their numbers, then takes the ball away. The bag contains $100$ balls numbered $1$ to $100$, all distinct. If a player's card contains the announced number, he may cross it out. The first player to cross out all numbers on his card wins; if multiple players cross out their last number at the same time, then none of them wins.

Given the numbers on each player's card, determine: for each player, whether there exists an order of drawing by the host such that this player wins.

Input Format

The first line contains an integer $t$, the number of players.

The next $t$ lines: the $i$-th line begins with an integer $n_i$, the number of integers on the $i$-th player's card, followed by $n_i$ integers, those numbers.

Output Format

Output $t$ lines: the $i$-th line is YES or NO, indicating whether the $i$-th player can win.

Sample Input

3
1 1
3 2 4 1
2 10 11

Sample Output

YES
NO
YES

Constraints

• $1 \le t \le 100$
• $1 \le n \le 100$
• $1 \le m_i \le 100$