#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1000000007;
void scan(int& a) { scanf("%d", &a); }
void scan(long long& a) { scanf("%lld", &a); }
template <class T>
void scan(T& a) {
  cin >> a;
}
template <class T>
void scan(vector<T>& vec) {
  for (auto&& it : vec) scan(it);
}
void in() {}
template <class Head, class... Tail>
void in(Head& head, Tail&... tail) {
  scan(head);
  in(tail...);
}
void print(const int& a) { printf("%d", a); }
void print(const long long& a) { printf("%lld", a); }
void print(const double& a) { printf("%.15lf", a); }
template <class T>
void print(const T& a) {
  cout << a;
}
template <class T>
void print(const vector<T>& vec) {
  if (vec.empty()) return;
  print(vec[0]);
  for (auto it = vec.begin(); ++it != vec.end();) {
    putchar(' ');
    print(*it);
  }
}
void out() { putchar('\n'); }
template <class T>
void out(const T& t) {
  print(t);
  putchar('\n');
}
template <class Head, class... Tail>
void out(const Head& head, const Tail&... tail) {
  print(head);
  putchar(' ');
  out(tail...);
}
template <class T>
void dprint(const T& a) {
  cerr << a;
}
template <class T>
void dprint(const vector<T>& vec) {
  if (vec.empty()) return;
  cerr << vec[0];
  for (auto it = vec.begin(); ++it != vec.end();) {
    cerr << " " << *it;
  }
}
void debug() { cerr << endl; }
template <class T>
void debug(const T& t) {
  dprint(t);
  cerr << endl;
}
template <class Head, class... Tail>
void debug(const Head& head, const Tail&... tail) {
  dprint(head);
  cerr << " ";
  debug(tail...);
}
int main() {
  int n, m;
  in(n, m);
  int k, s;
  vector<vector<int>> vec(m, vector<int>(n, 0));
  for (int q = 0; q < (int)(m); q++) {
    in(k);
    for (int p = 0; p < (int)(k); p++) {
      in(s);
      vec[q][s - 1] = 1;
    }
  }
  vector<int> p(m);
  int ans = 0;
  in(p);
  for (int i = 0; i < (1 << n); i++) {
    bitset<64> on(i);
    int sum = 0, d = 0;
    for (int q = 0; q < (int)(m); q++) {
      for (int j = 0; j < (1 << n); j++) {
        if (on.test(j)) sum += vec[q][j];
      }
      if (sum % 2 == p[q]) d++;
    }
    if (d == m) ans++;
  }
  out(ans);
}
