import java.util.Arrays;
import java.util.Scanner;
public class Main {

	public static void main(String[] args) {
		Scanner stdIn = new Scanner(System.in);
		
		int n = stdIn.nextInt();
		int m = stdIn.nextInt();
		
		boolean[] flag = new boolean[m];
		Arrays.fill(flag,true);
		
		for(int i = 0; i < n ; i++) {
			int k = stdIn.nextInt();
			int[]check = new int[k];
			for(int j = 0; j < k; j++) {
				check[j] = stdIn.nextInt();
				
				
				
			}
			
			
			for(int j = 0; j < m; j++) {
				boolean flag2 = false;
				for(int p = 0; p < k; p++) {
					if((j+1)==check[p]) {
						flag2 = true;
					}
				}
				if(!flag2) {
					flag[j] = false;
				}
				
				
				
			}
			
			
		}
		
		long cnt = 0;
		for(int i = 0; i < m; i++) {
			if(flag[i] == true) {
				cnt++;
			}
		}
		System.out.println(cnt);
		
	}

}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz