bulb

Description

Vasya wants to turn on Christmas lights consisting of m bulbs. Initially, all bulbs are turned off. There are n buttons, each of them is connected to some set of bulbs. Vasya can press any of these buttons. When the button is pressed, it turns on all the bulbs it's connected to. Can Vasya light up all the bulbs?

If Vasya presses the button such that some bulbs connected to it are already turned on, they do not change their state, i.e. remain turned on.

Input

The first line of the input contains integers n and m (1 ≤ n, m ≤ 100) — the number of buttons and the number of bulbs respectively.

Each of the next n lines contains xi (0 ≤ xi ≤ m) — the number of bulbs that are turned on by the i-th button, and then xi numbers yij (1 ≤ yij ≤ m) — the numbers of these bulbs.

Output

If it's possible to turn on all m bulbs print "YES", otherwise print "NO".

Sample Input

Input

3 4
2 1 4
3 1 3 1
1 2

Output

YES

Input

3 3
1 1
1 2
1 1

Output

NO

.

Hint

In the first sample you can press each button once and turn on all the bulbs. In the 2 sample it is impossible to turn on the 3-rd lamp

大致题意：先输入两个数n,m分别代表开关和灯泡个数，随后n行的每第一个数代表一个开关所控制的灯泡个数xi，xi后面所跟的数位灯泡的编号。。。关系就是这么乱

刚开始的思路是用数组记录每一行xi后的数字，后来感觉不现实。。看了别人的代码，才想起来用打表。。

代码：

#include<stdio.h>
int main(){
    int n,m,i;  
    while(~scanf("%d %d",&n,&m)){
        int a[101]={0};
    	for(i=0;i<n;i++){
    		int k;
        	scanf("%d",&k);  
        	for(int j=0;j<k;j++){
        		int x;
            	scanf("%d",&x);  
            	a[x]=1;  
        	}  
    	}
		for(i=1;i<=m;i++)
        if(a[i]==0) 
            break;   
    	if(i>m)        
        	printf("YES\n");
   		else                
        	printf("NO\n");  
    }
    return 0;          
}