#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

// is_extended flag is used for solving a linear_equation.
template<class T>
int Gauss(vector<vector<T>> &M,bool is_extended=false){// xor
    int R=M.size();
    int C=M[0].size();
    int rank=0;
    for(int j=0;j<C;j++){
        if(is_extended&&j+1==C) break;

        int pivot=-1;
        for(int i=rank;i<R;i++){
            if(M[i][j]){
                pivot=i;
                break;
            }
        }

        if(pivot>=0){
            if(pivot!=rank){
                for(int k=0;k<C;k++) swap(M[pivot][k],M[rank][k]);
            }

            for(int i=0;i<R;i++){
                if(i!=rank&&M[i][j]){
                    for(int k=0;k<C;k++) M[i][k]^=M[rank][k];
                }
            }
            rank++;
        }
    }
    return rank;
}

template<class T>
vector<T> linear_equation(vector<vector<T>> A,vector<T> B){
    int R=A.size();
    int C=A[0].size();
    vector<vector<T>> M(R,vector<T> (C+1,0));
    rep(i,R) rep(j,C) M[i][j]=A[i][j];
    rep(i,R) M[i][C]=B[i];

    // matrix M will be transformed.
    int rank=Gauss(M,true);

    vector<T> result;
    for(int i=rank;i<R;i++) if(M[i][C]) return result;

    result.resize(C,0);
    for(int i=0;i<rank;i++){
        int tar=-1;
        for(int j=0;j<C;j++){
            if(M[i][j]){
                tar=j;
                break;
            }
        }
        if(tar==-1) continue;
        result[tar]=M[i][C];
    }
    return result;
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int N,M;
  cin>>N>>M;
  vector<vector<int>> A(M,vector<int> (N,0));
  vector<int> B(M);
  rep(q,M){
      int K;
      cin>>K;
      vector<int> X(K);
      rep(i,K) cin>>X[i];
      rep(i,K) X[i]--;
      int value;
      cin>>value;
      
      rep(i,K) A[q][X[i]]=1;
      B[q]=value;
  }

  vector<int> ans=linear_equation(A,B);
  if(ans.empty()){
      cout<<-1<<endl;
      return 0;
  }
  for(auto n:ans) cout<<n<<"\n";

  return 0;
}