#include "Anthony.h"
#include<bits/stdc++.h>

using namespace std;

#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

#define ll long long
#define pb push_back
#define st first
#define nd second
#define sz(x) (int)(x).size()
#define all(x) (x).begin(),(x).end()
#define FOR(i,l,r) for(int i=(l);i<=(r);i++)
#define ROF(i,r,l) for(int i=(r);i>=(l);i--)

namespace {

const int N=20007;

vector<pair<int,int>>G[N];
vector<int>col;
bool odw[N];

vector<int>P={1,1,0,1,0,0};

void dfs(int v,int o,int d,int k)
{
	odw[v]=1;
	int C=0;
	if(k!=-1) 
	{
		col[k]=P[d];
		C=col[k];
	}
	debug(C,v);
	for(auto [u,c]:G[v]) 
	{
		if(u==o||odw[u]) continue;
		if(sz(G[v])==2) dfs(u,v,(d+1)%6,c);
		else
		{
			if(C) dfs(u,v,2,c);
			else dfs(u,v,0,c);
		} 
	}
}

}

vector<int> Mark(int n,int m,int A,int B,vector<int>U,vector<int>V) 
{
	col.resize(m);
	FOR(i,0,m-1)
	{
		G[U[i]].pb({V[i],i});
		G[V[i]].pb({U[i],i});
		col[i]=2;
	}
	dfs(0,0,0,-1);
	debug(col);
	return col;
}

#include "Catherine.h"
#include<bits/stdc++.h>

using namespace std;

#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

#define ll long long
#define pb push_back
#define st first
#define nd second
#define sz(x) (int)(x).size()
#define all(x) (x).begin(),(x).end()
#define FOR(i,l,r) for(int i=(l);i<=(r);i++)
#define ROF(i,r,l) for(int i=(r);i>=(l);i--)

namespace {
	int last=-1;
	bool ok=0;
	vector<int>V;
	set<vector<int>>X;
	vector<int>P={1,1,0,1,0,0};
}


void Init(int A, int B) {
	FOR(i,0,5) 
	{
		vector<int>VV;
		ROF(j,i,i-10)
		{
			VV.pb(P[(j%6+6)%6]);
			debug(VV);
			X.insert(VV);
		}
	}
}

int Move(vector<int>y)
{
	debug(last,y[0],y[1]);
	int S=y[0]+y[1];
	if(ok)
	{
		if(S>1) y[last]++;
		if(y[0]==1) return last=0;
		else return last=1;
	}
	else if(last==-1)
	{
		if(S!=2)
		{
			ok=1;
			if(y[0]==1) return last=0;
			else return last=1;
		}
		else
		{
			if(y[0]==2) V={0,0};
			else if(y[0]==1) V={0,1};
			else V={1,1};
			return last=V.back();
		}
	}
	else
	{
		if(S==0)
		{
			ok=1;
			return -1;
		}
		else if(S==1)
		{
			int t;
			if(y[0]==1) t=0;
			else t=1;
			V.pb(t);
			debug(V);
			if(sz(V)<10&&!X.count(V))
			{
				ok=1;
				return -1;
			}
			else return last=t;
		}
		else
		{
			ok=1;
			y[last]++;
			if(y[last]==1) return -1;
			if(y[0]==1) return last=0;
			else return last=1;
		}
	}
}