#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}

constexpr ll mod=1e9+7;

int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	int n,m; cin >> n >> m;
	vector<pair<ll,int>> basis;
	for(int i=0;i<m;i++){
		int a; cin >> a;
		ll u=0;
		while(a--){
			int b; cin >> b; b--;
			u+=(1LL<<b);
		}
		int y; cin >> y;
		for(auto e:basis){
			ll uu=(u^e.first);
			if(u>uu){
				u=uu;
				y^=e.second;
			}
		}
		if(u>0){
			basis.push_back({u,y});
		}
		else{
			if(y!=0){
				printf("-1\n"); return 0;
			}
		}
	}
	reverse(basis.begin(), basis.end());
	vector<int> res(n,-1);
	for(auto e:basis){
		for(int i=n-1;i>=0;i--){
			if(res[i]!=-1)continue;
			if((1LL<<i)&e.first){
				ll u=e.second;
				for(int j=0;j<n;j++){
					if(j==i)continue;
					if((1<<j)&e.first){
						if(res[j]==-1)res[j]=0;
						else{
							u^=res[j];
						}
					}
				}
				res[i]=u; break;
			}
		}
	}
	for(int i=0;i<n;i++){
		if(res[i]==-1)res[i]=0;
		printf("%d\n",res[i]);
	}
}