boolean[] visited;

int answer;

int N;

Set<Integer>[] inputs; // 각 입력 정수 배열을 set으로 변환

int[] matches;

public int solution(int n, int[][] q, int[] ans) {

answer = 0;

N = n;

inputs = new Set[q.length];

for(int i = 0; i < q.length; i++) {

inputs[i] = new HashSet<>();

for (int value : q[i]) {

inputs[i].add(value);

}

}

matches = ans;

visited = new boolean[n];

combination(0,5);

return answer;

}

// 1

void combination(int start, int r) {

if (r == 0) {

certify();

return;

} else {

for (int i = start; i < N; i++) {

visited[i] = true;

combination(i + 1, r - 1);

visited[i] = false;

}

}

}

void certify() {

// 2-1

Set<Integer> result = new HashSet<>();

for (int i = 0; i < N; i++) {

if (visited[i]) {

result.add(i+1);

}

}

// 2-2

for (int i = 0; i < inputs.length; i++) {

Set<Integer> intersection = new HashSet<>(result);

intersection.retainAll(inputs[i]);

if (intersection.size() != matches[i]) {

return;

}

}

answer++;

}

public static void main(String[] args) {

Solution388352 s = new Solution388352();

System.out.println(s.solution(10, new int[][] {

{1, 2, 3, 4, 5}, {6, 7, 8, 9, 10}, {3, 7, 8, 9, 10}, {2, 5, 7, 9, 10}, {3, 4, 5, 6, 7}

}, new int[] {2, 3, 4, 3, 3}));

System.out.println(s.solution(15, new int[][] {

{2, 3, 9, 12, 13}, {1, 4, 6, 7, 9}, {1, 2, 8, 10, 12}, {6, 7, 11, 13, 15}, {1, 4, 10, 11, 14}

}, new int[] {2, 1, 3, 0, 1}));

}

}