#include "Anthony.h"
#include <bits/stdc++.h>
using namespace std;
const int nx=2e4+5;
int dist[nx];
vector<int> d[nx];
std::vector<int> Mark(int N, int M, int A, int B,
std::vector<int> U, std::vector<int> V) {
for (int i=0; i<M; i++) d[U[i]].push_back(V[i]), d[V[i]].push_back(U[i]);
for (int i=1; i<N; i++) dist[i]=1e9;
queue<int> q;
q.push(0);
while (!q.empty())
{
auto u=q.front();
q.pop();
for (auto v:d[u]) if (dist[v]>dist[u]+1) dist[v]=dist[u]+1, q.push(v);
}
vector<int> res;
for (int i=0; i<M; i++) res.push_back(min(dist[U[i]], dist[V[i]])%3);
return res;
}
#include "Catherine.h"
#include <bits/stdc++.h>
using namespace std;
void Init(int A, int B) {
}
int Move(std::vector<int> y) {
if (y[0]) return y[2]?2:0;
return y[1]?1:2;
}
