codeforces 370B 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.

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.

Example

Input

31 13 2 4 12 10 11

Output

YESNOYES

Input

21 11 1

Output

NONO

  【题解】这道题是条件限制比较多的模拟题，题意是有n个人，还有一个荷官（其实就是一个喊号的~~），n个人每个人都有一张牌，牌上有一些数字（每个人的牌上没有相同的数字），现在荷官手里有一个袋子，里面是100个标号1~100的号码，每次从袋子里拿出一个号码念一下，所有n个人中凡是手中牌上有这个数字的，一律划掉，先划掉所有数字的人赢，输出YES，否则输出NO。

 注意坑点：1、每个人只有输或赢一种结果；

                   2、一开始判定输的人还有可能赢。

 

 【AC代码】

 

#include<iostream>#include<stdio.h>#include<map>#include<algorithm>#include<math.h>#include<queue>#include<stack>#include<string>#include<cstring>using namespace std;int vis[105];int a[105][105];int p[105][105];int num[105];int b[105];int t[105];int main(){    int i,j,k,s,n,x,tot,tag;    scanf("%d",&n);    for(i=0;i<n;i++)    {        memset(p[i],0,sizeof(p[i]));        vis[i]=0;        scanf("%d",&num[i]);        for(j=0;j<num[i];j++)        {            scanf("%d",&a[i][j]);            p[i][a[i][j]]=1;        }        sort(a[i],a[i]+num[i]);    }    for(i=0;i<n;i++)    {        if(vis[i]==1)            continue;        for(j=0;j<n;j++)            b[j]=num[j];        tag=0;        tot=0;        for(j=0;j<num[i];j++)        {            for(k=0;k<n;k++)            {                if(p[k][a[i][j]])                {                    b[k]--;                    if(b[k]==0)                    {                        tag=1;                        t[tot]=k;                        tot++;                    }                }            }            if(tag)                break;        }        vis[i]=-1;        if(tot==1)        {            vis[t[0]]=1;        }        else        {            for(j=0;j<tot;j++)            {                if(vis[t[j]]==1)                   continue;                vis[t[j]]=-1;            }        }    }    for(i=0;i<n;i++)    {        if(vis[i]==-1)            printf("NO\n");        else            printf("YES\n");    }    return 0;}