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.*;

class light{
	int[] switches;
	int p;
	
	public light(int[] switches){
		this.switches = switches;
		this.p = 0;
	}
	public void setp(int p){
		this.p = p;
	}
}

public class Main{
	public static void main(String[] args){
		int ans = 0;
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int m = sc.nextInt();
		light[] ls = new light[m];
		
		for(int i=0; i<m; i++){
			int k = sc.nextInt();
			int[] switches = new int[k];
			for(int j=0; j<k; j++){
				switches[j] = sc.nextInt();
			}
			ls[i] = new light(switches);
		}
		
		for(int i=0; i<m; i++){
			ls[i].setp(sc.nextInt());
		}
		
		int patterns = 1;
		for(int i=0; i<n; i++){
			patterns *= 2;
		}
		
		int[] on_off = new int[n];
		for(int i=0; i<patterns; i++){
			int p_copy = i;
			for(int j=0; j<n; j++){
				on_off[j] = p_copy % 2;
				p_copy = (p_copy - p_copy%2) / 2;
			}
			int all_ok = 1;
			pattern: for(int j=0; j<m; j++){
				light light = ls[j];
				int sum = 0;
				for(int k=0; k<light.switches.length; k++){
					sum += on_off[light.switches[k]-1];
				}
				if(sum % 2 != light.p){
					all_ok = 0;
					break pattern;
				}
			}
			if(all_ok == 1){
				ans++;
			}
		}
		
		System.out.println(ans);
	}
}
