P7280 [COCI 2020/2021 #4] Pizza

As a long and painful day is about to end, Mirko decides to order a pizza to cheer himself up. In a pile of papers on his desk, he finds a flyer from a nearby pizzeria.

The pizzeria offers $m$ different pizzas. Toppings are labeled with positive integers. The $i$-th pizza has $k_i$ toppings, with labels $b_{i,1},b_{i,2},\cdots,b_{i,k_i}$. Mirko is very picky about food. He does not like $n$ kinds of toppings, with labels $a_1,a_2,\cdots,a_n$, so he wants to order a pizza that does not contain any of the toppings above. Find the number of pizzas Mirko can order.

The first line contains an integer $n$, the number of toppings Mirko does not like. Then follow $n$ distinct integers $a_i$, the labels of the toppings Mirko does not like. The second line contains an integer $m$, the number of pizzas. In the next $m$ lines, the $i$-th line contains an integer $k_i$, the number of toppings on the $i$-th pizza. Then follow $k_i$ distinct integers $b_{i,j}$, the labels of the toppings on that pizza. There will not be two pizzas with exactly the same set of toppings.

Output the number of pizzas Mirko can order.

#### Constraints For $40\%$ of the testdata, $n=k_1=k_2=\cdots=k_m=1$. For $100\%$ of the testdata, $1 \le n,m,a_i,k_i,b_{i,j} \le 100$. #### Notes **The scoring of this problem follows the original COCI problem, with a full score of $50$.** **Translated from [COCI2020-2021](https://hsin.hr/coci/) [CONTEST #4](https://hsin.hr/coci/contest4_tasks.pdf) _T1 Pizza_.** Translated by ChatGPT 5