#include<bits/stdc++.h>
#define ford(i,a,b) for(int i=(a);i>=b;i--)
#define rep(i,a,b) for(int i=(a);(i)<(b);(i)++)
#define ll long long
#define re return
#define mp map<int,int>
using namespace std;
int main() {
	int n,m;
	cin>>n>>m;
	int k[m],s[m][n],p[m];
	ll ans=0;
	rep(i,0,m){
		cin>>k[i];
		rep(j,0,k[i]) cin>>s[i][j];
	}
	rep(i,0,m) cin>>p[i];
	rep(i,0,(1<<n)){
		int cnt=0;
		rep(j,0,m){
			int sum=0;
			rep(q,0,n){
				if(i&(1<<q))
                    rep(l,0,k[j])
						if(s[j][l]-1==q)sum++;
			}
			if(sum%2==p[j])cnt++;
		}
		if(cnt==m)ans++;
	}
	cout<<ans;
	re 0;
}
