#include "Anthony.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
namespace {
int n, m, a, b;
vector<pair<int, int> > link[20002];
vector<int> ans;
int dist[20002];
void bfs(){
queue<pair<int, int> > que;
dist[0] = 1;
que.push(make_pair(0, 1));
while(!que.empty()){
pair<int, int> tmp = que.front(); que.pop();
int x = tmp.first, d = tmp.second;
dist[x] = d;
for(auto y: link[x]){
if(dist[y.first]) continue;
dist[y.first] = d+1;
que.push(make_pair(y.first, d+1));
}
}
}
}
vector<int> Mark(int N, int M, int A, int B, vector<int> U, vector<int> V) {
n = N, m = M, a = A, b = B;
for(int i=0; i<m; i++) link[U[i]].push_back(make_pair(V[i], i)), link[V[i]].push_back(make_pair(U[i], i));
if(A >= 3){
bfs();
for(int i=0; i<m; i++){
ans.push_back((min(dist[U[i]], dist[V[i]]) + 2) % 3);
}
return ans;
}
}
#include "Catherine.h"
#include <bits/stdc++.h>
using namespace std;
namespace {
int A, B;
} // namespace
void Init(int A, int B) {
::A = A;
::B = B;
}
int Move(vector<int> y){
if(A >= 3){
vector<int> lVec;
for(int i=0; i<A; i++) for(int j=0; j<y[i]; j++) lVec.push_back(i);
y = lVec;
int MIN = *min_element(y.begin(), y.end());
int MAX = *max_element(y.begin(), y.end());
if(MIN==MAX) return MIN;
return MAX==1 ? 0 : MIN==1 ? 1 : 2;
}
}
