#include "Alice.h"
#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 8e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
vector<int> ans;
ll n,head[200020],cnt=0,d[200020];
bl ck[200020];
queue<ll> q;
struct node{
	ll nxt,to;
}e[1000010];
void add(ll u,ll v){
	e[++cnt].nxt=head[u];
	e[cnt].to=v;
	head[u]=cnt;
}
vector<int> Alice(int N,int M,vector<int> U,vector<int> V,vector<int> C){
	n=N;
	fr(i,0,M-1){
		add(U[i]+1,V[i]+1);
		add(V[i]+1,U[i]+1);
		d[U[i]+1]++;
		d[V[i]+1]++;
	}
	fr(i,1,n){
		if(d[i]<8){
			q.push(i);
			ck[i]=1;
		}
	}
	while(!q.empty()){
		ll u=q.front();
		q.pop();
		go(u){
			ll v=e[i].to;
			if(ck[v]) continue;
			d[v]--;
			if(d[v]<8){
				ck[v]=1;
				q.push(v);
			}
		}
	}
	fr(i,1,n){
		if(!ck[i]){
			ans.push_back(C[i-1]>>2);
			ans.push_back((C[i-1]>>1)&1);
		}
	}
	return ans;
}

#include "Bob.h"
#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 8e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
vector<int> ans;
ll n,head[200020],cnt=0,d[200020];
ll id[200020],tot=0,blg[200020];
bl ck[200020],vis[200020],pd[9];
queue<ll> q;
struct node{
	ll nxt,to;
}e[1000010];
void add(ll u,ll v){
	e[++cnt].nxt=head[u];
	e[cnt].to=v;
	head[u]=cnt;
}
vector<int> Bob(int N,int M,vector<int> U,vector<int> V,vector<int> X){
	n=N;
	fr(i,0,M-1){
		add(U[i]+1,V[i]+1);
		add(V[i]+1,U[i]+1);
		d[U[i]+1]++;
		d[V[i]+1]++;
	}
	fr(i,1,n){
		if(d[i]<8){
			q.push(i);
			ck[i]=1;
		}
	}
	while(!q.empty()){
		ll u=q.front();
		q.pop();
		id[++tot]=u;
		go(u){
			ll v=e[i].to;
			if(ck[v]) continue;
			d[v]--;
			if(d[v]<8){
				ck[v]=1;
				q.push(v);
			}
		}
	}
	ll now=0;
	fr(i,1,n){
		if(ck[i]) continue;
		blg[i]=(X[now]<<1)|X[now+1];
		now+=2;
	}
	ans.resize(n);
	fr(k,0,3){
		fr(s,1,n){
			if(ck[s]||vis[s]||blg[s]!=k) continue;
			q.push(s);
			vis[s]=1;
			ans[s-1]=k<<1;
			while(!q.empty()){
				ll u=q.front();
				q.pop();
				go(u){
					ll v=e[i].to;
					if(ck[v]||vis[v]||blg[v]!=k) continue;
					vis[v]=1;
					ans[v-1]=ans[u-1]^1;
				}
			}
		}
	}
	pfr(j,tot,1){
		ll u=id[j];
		fr(i,0,7) pd[i]=0;
		go(u){
			ll v=e[i].to;
			if(ck[v]) continue;
			pd[ans[v-1]]=1;
		}
		fr(i,0,7) if(!pd[i]) ans[u-1]=i;
		ck[u]=0;
	}
	return ans;
}