20660번 - Pizza 다국어

After a long day and miserable at work, Mirko decided to order a pizza for dinner to cheer himself up. In a big pile of papers on his desk, he found a flyer of a nearby pizza restarant.

The restarant offers m different pizzas. Pizza toppings are labeled with positive integers. i-th pizza has k_i toppings, with labels b_i,1, b_i,2, . . . , b_i,ki.

Mirko is very picky when it comes to food. He doesn’t like n toppings, those with labels a₁, a₂, . . . , a_n, so he wants to order a pizza that doesn’t contain any of those toppings. Determine the number of pizzas that Mirko can order.

The first line contains an integer n (1 ≤ n ≤ 100), the number of toppings, followed by n distinct integers a_i (1 ≤ a_i ≤ 100), the labels of toppings Mirko dislikes.

The second line contains an integer m (1 ≤ m ≤ 100), the number of pizzas.

The following m lines describe the pizzas. The i-th line contains an integer k_i (1 ≤ k_i ≤ 100), the numer of toppings, followed by k_i distinct integers b_i,j (1 ≤ b_i,j ≤ 100), the labels of toppings on the i-th pizza.

The pizzas, i.e. the sets of toppings, will be distinct.

Output the number of pizzas that Mirko can order.