#pragma region include
#include <stdio.h>
#include <string>
#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <bitset>
#include <cmath>
#pragma endregion
using namespace std;

#pragma region 定数
#define INF_VAL (2147483647 - 1)
#define INF_VAL_MINUS -INFVAL
#pragma endregion

#pragma region マクロ
// 型
#define ll long long

// 配列の長さを取得する(ただし関数内ではポインタサイズに注意)
#define SIZE_OF_ARRAY(array) sizeof(array) / sizeof(*array)

// for文
#define forn(i, size) for (long long(i) = 0; (i) < (size); (i)++)
#define for0(size) for (long(i) = 0; (i) < (size); (i)++)

// ソート
#define Sort(array, length) sort(array, array + length)
#define SortDESC(array, length, type_name) sort(array, array + length, std::greater<type_name>())

// 配列の最大値、最小値取得
#define MAX_OF_ARRAY(array, length) *max_element(array, array + length)
#define MIN_OF_ARRAY(array, length) *min_element(array, array + length)

// 結果出力系
#define YES                    \
    {                          \
        cout << "YES" << endl; \
        return 0;              \
    }
#define NO                    \
    {                         \
        cout << "NO" << endl; \
        return 0;             \
    }
#define Yes                    \
    {                          \
        cout << "Yes" << endl; \
        return 0;              \
    }
#define No                    \
    {                         \
        cout << "No" << endl; \
        return 0;             \
    }
#define println(str) cout << str << endl;

#pragma endregion

#pragma region Utility
#pragma region 配列要素の合計値を取得
template <typename T>
T getSum(T array[], int length)
{
    T sum = 0;
    for (int i = 0; i < length; i++)
    {
        sum += array[i];
    }
    return sum;
}
#pragma endregion

#pragma region ToString(int)
string ToString(int i)
{
    char buffer[1000];
    sprintf(buffer, "%d", i);
    return string(buffer);
}
#pragma endregion

#pragma region 10進数からN進数(<= 10) へ変換
string convertToN(long n, int base)
{
    string ans = "";
    while (n != 0)
    {
        int temp = n % base; // 1桁取得
        ans = ToString(temp) + ans;
        n /= base;
    }
    return ans;
}
#pragma endregion

#pragma region 連想配列のkeyが存在するか
template <typename T>
bool containsKey(map<string, T> map, string key)
{
    if (map.count(key) == 0)
    {
        return false;
    }
    return true;
}
#pragma endregion
#pragma endregion

int main()
{
    // 標準入力から値を取得
    int N, M;
    cin >> N >> M;

    // vector<vector<int>> switches;
    int switches[M][N];
    
    // 初期化
    forn(i, M)
    {
        int j = 0;
        forn(j, N)
        {
            switches[i][j] = 0;
        }
    }
    vector<int> p (M, 0);
    int i = 0;
    int k[M];
    forn(i, M)
    {
        cin >> k[i];
        int j = 0;
        forn(j, k[i])
        {
            cin >> switches[i][j];
        }
    }
    forn(i, M)
    {
        cin >> p[i];
    }

    int ans = 0;
    int clear_count;
    forn(p_i, pow(2, N))
    {
        bitset<10> bs(p_i);
        // println(bs2[0]);
        // println(bs2[1]);
        // println(bs2[2]);
        int m_i = 0, k_i = 0, right_count = 0;

        forn(m_i, M)
        {
            int on_count = 0;
            forn(k_i, k[m_i])
            {

                //cout << switches[m_i][k_i] - 1 << bs2[switches[m_i][k_i] - 1] << endl;
                if (bs[switches[m_i][k_i] - 1] == 1)
                {
                    // ONのスイッチの数
                    on_count++;
                }
            }
            if (on_count % 2 != p[m_i])
            {
                continue;
            }
            right_count++;
        }
        if (right_count == M)
        {
            ans++;
        }
    }

    // 結果出力
    printf("%d\n", ans);
}


Measured memory_bytes: 256