#include "Anthony.h"
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
namespace anton {
const int maxn = 1<<17;
vector<int> val, p, pidx, col, god = {0, 0, 1, 0, 1, 1};
vector<array<int, 2>> g[maxn];
void dfs(int v) {
for(auto &[i, idx] : g[v]) if(i != p[v]) {
p[i] = v, pidx[i] = idx;
col[i] = col[v]^1;
dfs(i);
}
//cout << v << " // " << col[v] << '\n';
if(!v || g[v].size() == 2) return;
int u = p[v];
vector<int> l {v};
while(u && g[u].size() == 2) {
l.pb(u);
u = p[u];
}
int b = 0;
while(god[b] != col[v] || god[(b + l.size() - 1)%6] != col[l.back()]) b++;
//cout << v << " /// " << b << endl;
//cout << god[b] << " vs " << col[v] << '\n';
for(int i = 0; i < l.size(); i++) val[pidx[l[i]]] = god[(i+b)%6];
}
}
namespace antOn {
const int maxn = 1<<17;
vector<array<int, 2>> g[maxn];
vector<int> val, lvl;
queue<int> q;
void solve() {
lvl[0] = 0;
q.push(0);
vector<array<int, 3>> edges(val.size());
while(!q.empty()) {
int u = q.front();
q.pop();
for(auto &[i, idx] : g[u]) {
if(lvl[i] == -1) {
lvl[i] = lvl[u] + 1;
q.push(i);
}
edges[idx] = {i, u, idx};
}
}
map<int, map<int, int>> col;
col[1][0] = col[0][1] = 0;
col[2][1] = col[1][2] = 1;
col[0][2] = col[2][0] = 2;
col[0][0] = 0;
col[1][1] = 1;
col[2][2] = 2;
for(auto [u, v, idx] : edges) val[idx] = col[lvl[u]%3][lvl[v]%3];
}
}
std::vector<int> Mark(int N, int M, int A, int B,
std::vector<int> U, std::vector<int> V) {
if(B == 0) {
for(int i = 0; i < M; i++) {
antOn::g[U[i]].pb({V[i], i});
antOn::g[V[i]].pb({U[i], i});
}
antOn::val.resize(M);
antOn::lvl.resize(N, -1);
antOn::solve();
return antOn::val;
}
using namespace anton;
val.resize(M);
for(int i = 0; i < M; i++) {
g[U[i]].pb({V[i], i});
g[V[i]].pb({U[i], i});
}
p.resize(N);
pidx.resize(N);
col.resize(N);
dfs(0);
//for(int i = 0; i < M; i++) cout << U[i] << " " << V[i] << " " << val[i] << '\n';
return val;
}
#include "Catherine.h"
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
namespace kate {
int A, B, gg = 0, lst = -2, mvs = 0;
string cur, god = "110100110100";
int decide(vector<int> c) {
if(B == 0) {
if(!c[0] && !c[1]) return 2;
if(!c[0] && !c[2]) return 1;
if(!c[1] && !c[2]) return 0;
if(c[0] && c[1]) return 0;
if(c[2] && c[1]) return 1;
if(c[2] && c[0]) return 2;
}
if(mvs++ > 10 && !gg) exit(-1);
if(c[0] + c[1] == 0) {
gg = 1;
return -1;
}
if(lst == -2 && c[0]+c[1] == 1) {
gg = 1;
return lst = c[1];
}
if(c[0] + c[1] + (lst != -2) > 2) {
gg = 1;
if(c[0] == 0) return -1;
if(c[1] == 0) return -1;
if(c[0] == 1 && lst != 0) return lst = 0;
if(c[1] == 1 && lst != 1) return lst = 1;
exit(-1);
}
if(c[0] + c[1] == 2) {
if(c[0]) {
cur.pb('0'+c[1]);
cur.pb('0');
return lst = 0;
}
cur += "11";
return lst = 1;
}
if(gg) return lst = c[1];
cur.pb('0'+c[1]);
if(cur.size() == 5) {
gg = 1;
//cout << " " << gg << "Yay\n";
if(god.find(cur) != string::npos) return -1;
}
return lst = c[1];
}
} // namespace
void Init(int A, int B) {
kate::A = A;
kate::B = B;
}
int Move(std::vector<int> y) {
//cout << y[0] << " " << y[1] << " go ";
int t = kate::decide(y);
//cout <<kate::cur << " " << t << endl;
return t;
}
