#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<long long, long long>;
long long dx[] = {1, 0, -1, 0};
long long dy[] = {0, 1, 0, -1};
constexpr ll mod = 1e9 + 7;
constexpr ll inf = INT32_MAX / 2;
constexpr ll INF = LLONG_MAX / 2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a <= b) {
    a = b;
    return true;
  }
  return false;
}
ll fact(long long i) {
  if (i == 0) return 1;
  return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
long long keta(ll n) {
  if (n == 0) return 1;
  long long count = 0;
  while (n != 0) {
    n /= 10;
    count++;
  }
  return count;
}
ll ketasum(ll n) {
  ll sum = 0;
  while (n != 0) {
    sum += n % 10;
    n /= 10;
  }
  return sum;
}
signed main() {
  long long n, m;
  cin >> n >> m;
  vector<vector<long long>> s(m);
  for (long long i = 0; i < (long long)(n); i++) {
    long long k;
    cin >> k;
    for (long long j = 0; j < (long long)(k); j++) {
      long long a;
      cin >> a;
      a--;
      s[k].push_back(a);
    }
  }
  vector<long long> p(m);
  for (long long i = 0; i < (long long)(m); i++) cin >> p[i];
  long long count = 0;
  for (long long bit = 0; bit < (1 << n); bit++) {
    bool ok = true;
    for (long long i = 0; i < m; i++) {
      long long cnt = 0;
      for (long long j = 0; j < s[i].size(); j++) {
        if (1 & (bit >> s[i][j])) {
          cnt++;
        }
      }
      if (cnt % 2 != p[i]) ok = false;
    }
    if (ok) count++;
  }
  cout << count << endl;
  return 0;
}
