#include "Anthony.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
namespace {
const int N = (int)20010;
vector<pii> T[N];
} // namespace
int n, m;
vector<int> idx;
int dep[N];
void make1(){
queue<int> que;
for(int i = 0 ; i < n; i ++ ){
dep[i]=-1;
}
for(int i = 0 ; i < m ; i ++ ){
idx[i]=-1;
}
dep[0]=0;
que.push(0);
int nd;
while(!que.empty()){
nd=que.front();
que.pop();
for(auto x : T[nd]){
if(dep[x.fi] == -1){
dep[x.fi]=(dep[nd]+1)%3;
que.push(x.fi);
}
if(idx[x.se] == -1) idx[x.se]=dep[nd];
}
}
}
vector<int> Mark(int _n, int _m, int a, int b, vector<int> u, vector<int> v) {
n = _n;
m = _m;
for(int i = 0 ; i < m ; i ++ ){
T[u[i]].push_back(mp(v[i],i));
T[v[i]].push_back(mp(u[i],i));
}
idx.resize(m);
if(a >= 3) make1();
return idx;
}
#include "Catherine.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
namespace {
int A;
} // namespace
void Init(int a, int b) {
A = a;
}
int move_3(vector<int> y){
for(int d = 0; d < 3; d ++ ){
if(y[d] > 0 && y[(d + 1) % 3] > 0) return d;
}
for(int d = 0; d < 3; d ++ ){
if(y[d] > 0) return d;
}
return -1;
}
int Move(std::vector<int> y) {
if(A >= 3) return move_3(y);
return -1;
}
