#include<bits/stdc++.h>
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
const int maxn=2e4+9;
vector<int>a[maxn];
bool vis[maxn];
int d[maxn];
std::vector<int> Mark(int N, int M, int A, int B,std::vector<int> U, std::vector<int> V) {
std::vector<int> x(M);
int n=N,m=M;
for1(i,0,m-1){
a[U[i]].pb(V[i]);
a[V[i]].pb(U[i]);
}
vis[0]=1;
queue<int>t;
t.push(0);
while (!t.empty()){
auto u=t.front();
t.pop();
for (auto v:a[u]){
if (vis[v])continue;
d[v]=d[u]+1;
t.push(v);
vis[v]=1;
}
}
for (int i = 0; i < M; ++i) {
int u=U[i],v=V[i];
if (d[u]==d[v]){
x[i]=3;
continue;
}
if (d[u]>d[v])swap(u,v);
int mask=0;
if (d[u]%3==2||d[v]%3==2)mask|=(1<<1);
if (d[u]%3==1||d[v]%3==1)mask|=(1<<0);
x[i]=mask-1;
}
return x;
}
#include<bits/stdc++.h>
using namespace std;
#define all(fl) fl.begin(),fl.end()
#define pb push_back
#define fi first
#define se second
#define for1(i,j,k) for(int i=j;i<=k;i++)
#define for2(i,j,k) for(int i=j;i>=k;i--)
#define for3(i,j,k,l) for(int i=j;i<=k;i+=l)
#define lb lower_bound
#define ub upper_bound
#define sz(a) (int)a.size()
#define pii pair<int,int>
#define pli pair<long long,int>
#define gcd __gcd
#define lcm(x,y) x*y/__gcd(x,y)
namespace {
int A, B;
int variable_example = 0;
} // namespace
void Init(int A, int B) {
::A = A;
::B = B;
}
int cnt[3];
int Move(std::vector<int> y) {
int ct=0;
for1(i,0,2){
if (y[i]!=0)ct++;
}
if (ct==1){
for1(i,0,2){
if (y[i]!=0)return i;
}
}
for1(i,0,2)cnt[i]=0;
for1(i,0,2){
if (y[i]!=0){
int j=i+1;
for1(k,0,1){
if (j>>k&1){
cnt[(1<<k)]++;
}
else {
cnt[0]++;
}
}
}
}
for1(i,0,2){
if (cnt[i]==2){
int ans=i;
int gg=(i-1+3)%3;
ans+=gg;
return ans-1;
}
}
}
