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.util.Scanner;

public class Main{
	public static void main(String[] args) {
		Scanner sc =  new Scanner(System.in);
		int s = 1<<(sc.nextInt());
		int e = sc.nextInt();
		Condition[] cons = new Condition[e];
		
		for(int i=0;i<e;i++) {
			int n = sc.nextInt();
			int[] arr = new int[n];
			for(int j=0;j<n;j++) {
				arr[j] = sc.nextInt();
			}
			cons[i] = new Condition(arr);
		}
		
		for(int i=0;i<e;i++) 
			cons[i].OE = sc.nextInt();
		
		sc.close();
		int j;
		int count = 0;
		for(int i=0;i<s;i++) {
			for(j=0;j<e;j++) {
				if(!cons[j].meets(i))
					break;
			}
			if(j==e)
				count++;
		}
		System.out.println(count);
	}
}

class Condition{
	int[] nums;
	int OE;
	
	Condition(int[] nums){
		this.nums = nums;
	}
	
	
	boolean meets(int state) {
		int sum = 0;
		for(int i=0;i<nums.length;i++)
			sum += (state >> (nums[i]-1))&1;
		return OE == (sum&1);
	}
}