CF370B.Berland Bingo

Lately, a national version of a bingo game has become very popular in Berland. There are n players playing the game, each player has a card with numbers. The numbers on each card are distinct, but distinct cards can have equal numbers. The card of the i-th player contains m__i numbers.

During the game the host takes numbered balls one by one from a bag. He reads the number aloud in a high and clear voice and then puts the ball away. All participants cross out the number if it occurs on their cards. The person who crosses out all numbers from his card first, wins. If multiple people cross out all numbers from their cards at the same time, there are no winners in the game. At the beginning of the game the bag contains 100 balls numbered 1 through 100, the numbers of all balls are distinct.

You are given the cards for each player. Write a program that determines whether a player can win the game at the most favorable for him scenario or not.

最近，一种国家级的宾果游戏在贝尔兰非常流行。共有 $n$ 名玩家参与该游戏，每名玩家都拥有一张写有数字的卡片。每张卡片上的数字互不相同，但不同卡片之间可以有相同的数字。第 $i$ 位玩家的卡片上包含 $m_i$ 个数字。

游戏过程中，主持人依次从一个袋子中随机取出编号的小球，并用洪亮清晰的声音报出小球上的数字，然后将该小球移出游戏。所有玩家若在自己的卡片上看到该数字，就将其划掉。最先划掉自己卡片上所有数字的玩家获胜。如果多名玩家同时划掉自己卡片上的所有数字，则本次游戏无人获胜。游戏开始时，袋子中共有 100 个小球，编号为 $1$ 至 $100$，所有小球的编号互不相同。

你将获得每位玩家的卡片信息。请编写一个程序，判断某位玩家是否能在对其最有利的情形下赢得该游戏。

The first line of the input contains integer n (1 ≤ n ≤ 100) — the number of the players. Then follow n lines, each line describes a player's card. The line that describes a card starts from integer m__i (1 ≤ m__i ≤ 100) that shows how many numbers the i-th player's card has. Then follows a sequence of integers a__i, 1, a__i, 2, ..., a__i, m__i (1 ≤ a__i, k ≤ 100) — the numbers on the i-th player's card. The numbers in the lines are separated by single spaces.

It is guaranteed that all the numbers on each card are distinct.

输入的第一行包含一个整数 $n$（$1 \leq n \leq 100$）—— 表示玩家的数量。接下来有 $n$ 行，每行描述一位玩家的卡片。描述卡片的行以整数 $m_i$（$1 \leq m_i \leq 100$）开头，表示第 $i$ 位玩家的卡片上有多少个数字；随后是一串整数 $a_{i,1},\ a_{i,2},\ \dots,\ a_{i,m_i}$（$1 \leq a_{i,k} \leq 100$）—— 表示第 $i$ 位玩家卡片上的数字。同一行中的数字用单个空格分隔。

保证每位玩家卡片上的所有数字互不相同。

Print n lines, the i-th line must contain word "YES" (without the quotes), if the i-th player can win, and "NO" (without the quotes) otherwise.

输出 n 行，其中第 i 行必须包含单词 "YES"（不带引号），如果第 i 位玩家能够获胜；否则包含 "NO"（不带引号）。