import java.util.*;

class Main {
    public static void main(String[] args) {
        new Solver().run();
    }
}

class Solver {

    private Set<Integer> createSet(int M) {
        Set<Integer> set = new HashSet<Integer>();
        for (int i = 1; i <= M; i++) {
            set.add(i);
        }
        return set;
    }

    public void run() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int M = sc.nextInt();

        boolean[] ok = new boolean[M + 1];
        Arrays.fill(ok, true);

        for (int i = 0; i < N; i++) {
            int K = sc.nextInt();
            Set<Integer> dislike = createSet(M);
            for (int j = 0; j < K; j++) {
                int A = sc.nextInt();
                if (dislike.contains(A)) {
                    dislike.remove(A);
                }
            }
            for (int A : dislike) {
                ok[A] = false;
            }
        }


        int cnt = 0;
        for (int i = 1; i <= M; i++) {
            if (ok[i]) {
                cnt++;
            }
        }

        System.out.println(cnt);

        return;
    }

}
/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