#include "Anthony.h"
#include "bits/stdc++.h"
#define FOR(i, l, r) for(int i = (l); i < (r); ++i)
#define ROF(i, r, l) for(int i = (r)-1; i >= (l); --i)
#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define sz(v) (int)v.size()
#define pb push_back
#define eb emplace_back
#define compact(v) v.erase(unique(all(v)), end(v))
#define dbg(x) "[" #x " = " << (x) << "]"
using namespace std;
template<typename T>
bool minimize(T& a, const T& b){
if(a > b) return a = b, true;
return false;
}
template<typename T>
bool maximize(T& a, const T& b){
if(a < b) return a = b, true;
return false;
}
using ll = long long;
using db = double;
using ld = long double;
using ull = unsigned long long;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using vc = vector<char>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vvi = vector<vi>;
using vvl = vector<vl>;
vi Mark(int N, int M, int A, int B, vi U, vi V) {
if(A >= 3){
vector<vpi> adj(N);
FOR(i, 0, M){
int u = U[i], v = V[i];
adj[u].eb(v, i);
adj[v].eb(u, i);
}
vi result(M, -1), d(N, -1);
queue<int> q;
d[0] = 0;
q.push(0);
while(!q.empty()){
int u = q.front(); q.pop();
FOR(z, 0, sz(adj[u])){
int v, id; tie(v, id) = adj[u][z];
if(d[v] == -1){
d[v] = d[u] + 1;
q.push(v);
}
}
}
FOR(i, 0, M){
int u = U[i], v = V[i];
result[i] = (max(d[u], d[v]) - (d[u] != d[v])) % 3;
}
return result;
}
//subtask 5
vector<vpi> adj(N);
FOR(i, 0, M){
int u = U[i], v = V[i];
adj[u].eb(v, i);
adj[v].eb(u, i);
}
vi result(M, -1), d(N, -1);
queue<int> q;
d[0] = 0;
q.push(0);
while(!q.empty()){
int u = q.front(); q.pop();
FOR(z, 0, sz(adj[u])){
int v, id; tie(v, id) = adj[u][z];
if(d[v] == -1){
d[v] = d[u] + 1;
q.push(v);
}
}
}
FOR(i, 0, M){
int u = U[i], v = V[i];
result[i] = (max(d[u], d[v]) - 1) % 2;
}
return result;
}
#include "Catherine.h"
#include "bits/stdc++.h"
#define FOR(i, l, r) for(int i = (l); i < (r); ++i)
#define ROF(i, r, l) for(int i = (r)-1; i >= (l); --i)
#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define sz(v) (int)v.size()
#define pb push_back
#define eb emplace_back
#define compact(v) v.erase(unique(all(v)), end(v))
#define dbg(x) "[" #x " = " << (x) << "]"
using namespace std;
template<typename T>
bool minimize(T& a, const T& b){
if(a > b) return a = b, true;
return false;
}
template<typename T>
bool maximize(T& a, const T& b){
if(a < b) return a = b, true;
return false;
}
using ll = long long;
using db = double;
using ld = long double;
using ull = unsigned long long;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using vc = vector<char>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vvi = vector<vi>;
using vvl = vector<vl>;
int A, B, last_mark = -1, cur = -1;
void Init(int A, int B) {
::A = A;
::B = B;
}
int Move(std::vector<int> y) {
if(A >= 3){
int cnt = 0;
FOR(i, 0, sz(y)) cnt += (y[i] > 0);
if(cnt == 1){
FOR(i, 0, sz(y)) if(y[i] > 0) return i;
assert(false);
}
if(y[0] > 0 && y[1] > 0) return 0;
if(y[1] > 0 && y[2] > 0) return 1;
if(y[2] > 0 && y[0] > 0) return 2;
assert(false);
}
//subtask 5
//assume we got into a leaves, just redo every operation
if(last_mark == -1){
int cnt = 0;
FOR(i, 0, 2){
cnt += (y[i] > 0);
}
if(cnt == 1){
FOR(i, 0, 2){
if(y[i] > 0){
last_mark = i;
cur = i;
return i;
}
}
assert(false && true);
}
last_mark = 0;
cur = 0;
return 0;
}
int cnt = 0;
FOR(i, 0, sz(y)){
cnt += y[i] > 0;
}
if(cnt == 0){
//a leaf != 0 -> move back
return -1;
}
cur ^= 1;
return cur;
}
