The first line contains two numbers, N T, where N represent the number of skill set and T represent the number of wizards.

Next line contains N space separated integers, C₁ C₂ … C_N, where C_i represents the number of people with i^th skill. Then follows 2×T lines, where each pair of line represent the configuration of each wizard.

First line of the pair will start with the length of list A and followed by list A in the same line. Similarly second line of the pair starts with the length of list B and then the list B.

Constraints
$1 \le N \le 200$
$0 \le T \le 30$
$0 \le C_i \le 10$
$0 \le |A| \le 50$
$1 \le A_i \le N$
$A_i \ne A_j, 1 \le i < j \le |A|$
$0 \le |B| \le 50$
$1 \le B_i \le N$
$B_i \ne B_j, 1 \le i < j \le |B|$

The output must consist of one number, the maximum number of distinct skill set that can the people of country learn, after making optimal transformation steps.

There are 3 types of skill set present and only 1 wizard. Initially all three people know 1^st skill set, while no one knows 2^nd and 3^rd skill set.



First, and only, wizard' initial list are: A=[1] and B=[2,3]. So he can perform any of the 1→2 or 1→3 transformation. Suppose he go for 1→2 transformation on any of person with 1st skill set, then list A will be updated to an empty list [] and and list B will be [3]. Now he can't perform another transformation as list A is empty. So there will be two people with 1^st skill set, and 1 people with 2^nd skill set. So there are two skill sets available in the kingdom.

Migrated from old NTUJ.