We have N switches with "on" and "off" state, and M bulbs. The switches are numbered 1 to N, and the bulbs are numbered 1 to M.

Bulb i is connected to k_i switches: Switch s_{i1}, s_{i2}, ..., and s_{ik_i}. It is lighted when the number of switches that are "on" among these switches is congruent to p_i modulo 2.

How many combinations of "on" and "off" states of the switches light all the bulbs?

Constraints

* 1 \leq N, M \leq 10
* 1 \leq k_i \leq N
* 1 \leq s_{ij} \leq N
* s_{ia} \neq s_{ib} (a \neq b)
* p_i is 0 or 1.
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N M
k_1 s_{11} s_{12} ... s_{1k_1}
:
k_M s_{M1} s_{M2} ... s_{Mk_M}
p_1 p_2 ... p_M


Output

Print the number of combinations of "on" and "off" states of the switches that light all the bulbs.

Examples

Input

2 2
2 1 2
1 2
0 1


Output

1


Input

2 3
2 1 2
1 1
1 2
0 0 1


Output

0


Input

5 2
3 1 2 5
2 2 3
1 0


Output

8
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Set;

public class Main {
    public static void main(String[] args) throws Exception {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        String[] nm = reader.readLine().split(" ");
        int n = Integer.parseInt(nm[0]);
        int m = Integer.parseInt(nm[1]);
        int[] k = new int[m];
        int[][] s = new int[m][];
        for (int i = 0; i < m; i++) {
            String[] arr = reader.readLine().split(" ");
            k[i] = Integer.parseInt(arr[0]);
            s[i] = new int[k[i]];
            for (int j = 0; j < k[i]; j++) {
                s[i][j] = Integer.parseInt(arr[j + 1]);
            }
        }
        String[] parr = reader.readLine().split(" ");
        int[] p = new int[m];
        for (int i = 0; i < m; i++) {
            p[i] = Integer.parseInt(parr[i]);
        }
        int maxState = 1 << n;
        Set<Integer> set = new HashSet<>(maxState);
        for (int i = 0; i < maxState; i++) {
            set.add(i);
        }
        for (int i = 0; i < m; i++) {
            for (Iterator<Integer> iter = set.iterator(); iter.hasNext(); ) {
                int cur = iter.next();
                int count = 0;
                for (int j = 0; j < k[i]; j++) {
                    int tmp = (cur >> (s[i][j] - 1)) & 1;
                    if (tmp == 1) {
                        count++;
                    }
                }
                if (count % 2 != p[i]) {
                    iter.remove();
                }
            }
        }
        System.out.println(set.size());
    }
}
