#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i,n)for (int i = 0; i < int(n); ++i)
#define rrep(i,n)for (int i = int(n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) {a = max(a, b);}
template<class T> void chmin(T& a, const T& b) {a = min(a, b);}
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    vector<pair<ll, int>> d(m);
    rep(i, m) {
        int t;
        cin >> t;
        ll x = 0;
        rep(_, t) {
            int b;
            cin >> b;
            b--;
            x |= 1LL << b;
        }
        d[i].first = x;
        cin >> d[i].second;
    }
    vector<pair<ll, int>> basis;
    for(auto& [a, y]: d) {
        for(auto [c, z]: basis) {
            if ((a ^ c) < a) {
                a ^= c;
                y ^= z;
            }
        }
        if (a == 0) {
            if (y != 0) {
                cout << -1 << endl;
                return 0;
            }
        } else {
            basis.emplace_back(a, y);
        }
    }
    sort(all(basis));
    VI ans(n);
    for(auto [a, y]: basis) {
        int now = 0;
        rep(i, n) {
            if (a >> i & 1) {
                if (a == (1LL << i)) {
                    ans[i] = now ^ y;
                    break;
                }
                now ^= ans[i];
                a ^= (1LL << i);
            }
        }
    }
    rep(i, n) cout << ans[i] << '\n';
}