import java.util.*;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();
        int[] food = new int[m];
        for (int i = 0; i < m; i++) {
            food[i] = 1;
        }

        for (int i = 0; i < n; i++) {
            int k = sc.nextInt();
            Set<Integer> set = new HashSet();
            for (int j = 0; j < k; j++) {
                set.add(sc.nextInt() - 1);
            }
            for (int j = 0; j < m; j++) {
                if (!set.contains(j)) food[j] = 0;
            }
        }

        int count = 0;
        for (int i = 0; i < m; i++) {
            if (food[i] == 1) count++;
        }

        System.out.println(count);
    }
} import java.util.*; util.* java public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();
        int[] food = new int[m];
        for (int i = 0; i < m; i++) {
            food[i] = 1;
        }

        for (int i = 0; i < n; i++) {
            int k = sc.nextInt();
            Set<Integer> set = new HashSet();
            for (int j = 0; j < k; j++) {
                set.add(sc.nextInt() - 1);
            }
            for (int j = 0; j < m; j++) {
                if (!set.contains(j)) food[j] = 0;
            }
        }

        int count = 0;
        for (int i = 0; i < m; i++) {
            if (food[i] == 1) count++;
        }

        System.out.println(count);
    }
} Main public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();
        int[] food = new int[m];
        for (int i = 0; i < m; i++) {
            food[i] = 1;
        }

        for (int i = 0; i < n; i++) {
            int k = sc.nextInt();
            Set<Integer> set = new HashSet();
            for (int j = 0; j < k; j++) {
                set.add(sc.nextInt() - 1);
            }
            for (int j = 0; j < m; j++) {
                if (!set.contains(j)) food[j] = 0;
            }
        }

        int count = 0;
        for (int i = 0; i < m; i++) {
            if (food[i] == 1) count++;
        }

        System.out.println(count);
    } main {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();
        int[] food = new int[m];
        for (int i = 0; i < m; i++) {
            food[i] = 1;
        }

        for (int i = 0; i < n; i++) {
            int k = sc.nextInt();
            Set<Integer> set = new HashSet();
            for (int j = 0; j < k; j++) {
                set.add(sc.nextInt() - 1);
            }
            for (int j = 0; j < m; j++) {
                if (!set.contains(j)) food[j] = 0;
            }
        }

        int count = 0;
        for (int i = 0; i < m; i++) {
            if (food[i] == 1) count++;
        }

        System.out.println(count);
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int m = sc.nextInt(); m sc.nextInt() sc.nextInt sc int[] food = new int[m]; food new int[m] m for (int i = 0; i < m; i++) {
            food[i] = 1;
        } int i = 0; int i = 0; i 0 i < m i m i++ i++ i {
            food[i] = 1;
        } {
            food[i] = 1;
        } food[i] = 1 food[i] food i 1 for (int i = 0; i < n; i++) {
            int k = sc.nextInt();
            Set<Integer> set = new HashSet();
            for (int j = 0; j < k; j++) {
                set.add(sc.nextInt() - 1);
            }
            for (int j = 0; j < m; j++) {
                if (!set.contains(j)) food[j] = 0;
            }
        } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
            int k = sc.nextInt();
            Set<Integer> set = new HashSet();
            for (int j = 0; j < k; j++) {
                set.add(sc.nextInt() - 1);
            }
            for (int j = 0; j < m; j++) {
                if (!set.contains(j)) food[j] = 0;
            }
        } {
            int k = sc.nextInt();
            Set<Integer> set = new HashSet();
            for (int j = 0; j < k; j++) {
                set.add(sc.nextInt() - 1);
            }
            for (int j = 0; j < m; j++) {
                if (!set.contains(j)) food[j] = 0;
            }
        } int k = sc.nextInt(); k sc.nextInt() sc.nextInt sc Set<Integer> set = new HashSet(); set new HashSet() for (int j = 0; j < k; j++) {
                set.add(sc.nextInt() - 1);
            } int j = 0; int j = 0; j 0 j < k j k j++ j++ j {
                set.add(sc.nextInt() - 1);
            } {
                set.add(sc.nextInt() - 1);
            } set.add(sc.nextInt() - 1) set.add set sc.nextInt() - 1 sc.nextInt() sc.nextInt sc 1 for (int j = 0; j < m; j++) {
                if (!set.contains(j)) food[j] = 0;
            } int j = 0; int j = 0; j 0 j < m j m j++ j++ j {
                if (!set.contains(j)) food[j] = 0;
            } {
                if (!set.contains(j)) food[j] = 0;
            } if (!set.contains(j)) food[j] = 0; !set.contains(j) set.contains(j) set.contains set j food[j] = 0 food[j] food j 0 int count = 0; count 0 for (int i = 0; i < m; i++) {
            if (food[i] == 1) count++;
        } int i = 0; int i = 0; i 0 i < m i m i++ i++ i {
            if (food[i] == 1) count++;
        } {
            if (food[i] == 1) count++;
        } if (food[i] == 1) count++; food[i] == 1 food[i] food i 1 count++ count System.out.println(count) System.out.println System.out System System.out count String[] args args public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();
        int[] food = new int[m];
        for (int i = 0; i < m; i++) {
            food[i] = 1;
        }

        for (int i = 0; i < n; i++) {
            int k = sc.nextInt();
            Set<Integer> set = new HashSet();
            for (int j = 0; j < k; j++) {
                set.add(sc.nextInt() - 1);
            }
            for (int j = 0; j < m; j++) {
                if (!set.contains(j)) food[j] = 0;
            }
        }

        int count = 0;
        for (int i = 0; i < m; i++) {
            if (food[i] == 1) count++;
        }

        System.out.println(count);
    }
} public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();
        int[] food = new int[m];
        for (int i = 0; i < m; i++) {
            food[i] = 1;
        }

        for (int i = 0; i < n; i++) {
            int k = sc.nextInt();
            Set<Integer> set = new HashSet();
            for (int j = 0; j < k; j++) {
                set.add(sc.nextInt() - 1);
            }
            for (int j = 0; j < m; j++) {
                if (!set.contains(j)) food[j] = 0;
            }
        }

        int count = 0;
        for (int i = 0; i < m; i++) {
            if (food[i] == 1) count++;
        }

        System.out.println(count);
    }
} Main
import java.util.*;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();
        int[] food = new int[m];
        for (int i = 0; i < m; i++) {
            food[i] = 1;
        }

        for (int i = 0; i < n; i++) {
            int k = sc.nextInt();
            Set<Integer> set = new HashSet();
            for (int j = 0; j < k; j++) {
                set.add(sc.nextInt() - 1);
            }
            for (int j = 0; j < m; j++) {
                if (!set.contains(j)) food[j] = 0;
            }
        }

        int count = 0;
        for (int i = 0; i < m; i++) {
            if (food[i] == 1) count++;
        }

        System.out.println(count);
    }
}