Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
B. Berland Bingo

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputLately, 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.

Input

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, mi} (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.

Output

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.

Examples

Input

3

1 1

3 2 4 1

2 10 11

Output

YES

NO

YES

Input

2

1 1

1 1

Output

NO

NO

Codeforces (c) Copyright 2010-2022 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Aug/10/2022 16:30:26 (k3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|