H - Bulbs 【水题】

H - Bulbs

 

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 x_i (0 ≤ x_i ≤ m) — the number of bulbs that are turned on by the i-th button, and then x_i numbers y_ij (1 ≤ y_ij ≤ m) — the numbers of these bulbs.

Output

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

Example

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

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.

大致意思就是判断代表灯泡那个数是否出现过。

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