#include "Anthony.h"
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define FOR(i,a,b) for(int i = a; i < b; i++)
#define ROF(i,a,b) for(int i = a; i >=b; i--)
#define pb push_back
#define ms memset
#define fi first
#define se second
namespace {
int FunctionExample(int i, int A) {
return i % A;
}
} // namespace
vi Mark(int n, int m, int a, int b, vi U, vi V) {
vi x(m); FOR(i,0,m) x[i]=-1;
vii g[n];
FOR(i,0,m){
g[U[i]].pb({V[i],i}); g[V[i]].pb({U[i],i});
}
vi used(n), dist(n);
vi bfs; bfs.pb(0); used[0]=1;
FOR(i,0,bfs.size()){
int u = bfs[i];
for (ii e : g[u]){
int v = e.fi;
if (used[v]) continue;
dist[v] = dist[u]+1; used[v]=1; bfs.pb(v);
}
}
FOR(i,0,m){
x[i] = (min(dist[U[i]], dist[V[i]])+1) % 3;
}
return x;
}
#include "Catherine.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;
#define FOR(i,a,b) for(int i = a; i < b; i++)
#define ROF(i,a,b) for(int i = a; i >=b; i--)
#define pb push_back
#define ms memset
#define fi first
#define se second
namespace {
int A, B;
int variable_example = 0;
} // namespace
void Init(int A, int B) {
::A = A;
::B = B;
}
int Move(vi y) {
if (y[0]+y[1]+y[2] == max(max(y[0],y[1]),y[2])){
FOR(i,0,3){
if (y[i] != 0) return i;
}
}
FOR(i,0,3){
if (y[i]==0){
return (i+1)%3;
}
}
return -1;
}
