#include<bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;
// const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}


const int MAX_ROW = 10001; // to be set appropriately
const int MAX_COL = 51; // to be set appropriately
struct BitMatrix {
  int H, W;
  bitset< MAX_COL > val[MAX_ROW];

  BitMatrix(int m = 1, int n = 1) : H(m), W(n) {}

  inline bitset< MAX_COL > &operator[](int i) { return val[i]; }
};

int GaussJordan(BitMatrix &A, bool is_extended = false) {
  int rank = 0;
  for(int col = 0; col < A.W; ++col) {
    if(is_extended && col == A.W - 1) break;
    int pivot = -1;
    for(int row = rank; row < A.H; ++row) {
      if(A[row][col]) {
        pivot = row;
        break;
      }
    }
    if(pivot == -1) continue;
    swap(A[pivot], A[rank]);
    for(int row = 0; row < A.H; ++row) {
      if(row != rank && A[row][col]) A[row] ^= A[rank];
    }
    ++rank;
  }
  return rank;
}

int linear_equation(BitMatrix A, vector< int > b, vector< int > &res) {
  int m = A.H, n = A.W;
  BitMatrix M(m, n + 1);
  for(int i = 0; i < m; ++i) {
    for(int j = 0; j < n; ++j) M[i][j] = A[i][j];
    M[i][n] = b[i];
  }
  int rank = GaussJordan(M, true);

  // check if it has no solution
  for(int row = rank; row < m; ++row) if(M[row][n]) return -1;

  // answer
  res.assign(n, 0);
  for(int i = 0; i < rank; ++i) res[i] = M[i][n];
  return rank;
}


int main() {
  int N, M;
  cin >> N >> M;

  BitMatrix a(M, N);
  vector< int > b(M);
  for(int i = 0; i < M; i++) {
    int sz, y;
    cin >> sz;
    for(int j = 0; j < sz; j++) {
      int x;
      cin >> x;
      --x;
      a[i][x] = 1;
    }
    cin >> y;
    b[i] = y;
  }
  vector< int > ret(N);
  for(int i = 29; i >= 0; i--) {
    vector< int > c(M);
    for(int j = 0; j < M; j++) {
      c[j] = (b[j] >> i) & 1;
    }
    vector< int > res(N);
    if(linear_equation(a, c, res) == -1) {
      cout << -1 << "\n";
      return 0;
    }
    for(int j = 0; j < N; j++) {
      ret[j] |= res[j] << i;
    }
  }
  for(int i = 0; i < N; i++) {
    cout << ret[i] << "\n";
  }
}