#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(abs(a), abs(b));}
ll lcm(ll a, ll b){return abs(a) / gcd(a, b) * abs(b);}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
for(auto item: container) out << item << separator;
out << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
#include "Anthony.h"
namespace Sub1{
vector<int> solve(int N, int M, int A, int B, vector<int> U, vector<int> V){
int n = N, m = M;
vector<vector<int>> graph(n);
for(int i = 0; i < m; ++i) {
int u = U[i], v = V[i];
graph[u].push_back(v);
graph[v].push_back(u);
}
vector<int> dis(n, 1e9 + 69);
deque<int> q; q.push_back(0);
dis[0] = 0;
while(q.size()){
int u = q.front(); q.pop_front();
for(int v: graph[u]) {
if (minimize(dis[v], dis[u] + 1))
q.push_back(v);
}
}
vector<int> ans;
for(int i = 0; i < m; ++i) {
int u = U[i], v = V[i];
if (dis[u] > dis[v]) swap(u, v);
ans.push_back(dis[u] % 3);
}
return ans;
}
}
namespace Sub2{
vector<int> solve(int N, int M, int A, int B, vector<int> U, vector<int> V){
int n = N, m = M;
vector<vector<int>> graph(n);
for(int i = 0; i < m; ++i) {
int u = U[i], v = V[i];
graph[u].push_back(v);
graph[v].push_back(u);
}
vector<int> dis(n, 1e9 + 69);
deque<int> q; q.push_back(0);
dis[0] = 0;
while(q.size()){
int u = q.front(); q.pop_front();
for(int v: graph[u]) {
if (minimize(dis[v], dis[u] + 1))
q.push_back(v);
}
}
vector<int> ans;
for(int i = 0; i < m; ++i) {
int u = U[i], v = V[i];
if (dis[u] > dis[v]) swap(u, v);
ans.push_back(dis[u] % 2);
}
return ans;
}
}
vector<int> Mark(int N, int M, int A, int B, vector<int> U, vector<int> V){
if (A >= 3) return Sub1::solve(N, M, A, B, U, V);
return Sub2::solve(N, M, A, B, U, V);
}
// int main(void){
// ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
// return 0;
// }
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#include "Catherine.h"
int current_subtask = 0;
void Init(int A, int B){
if (A >= 3) current_subtask = 1;
else current_subtask = 2;
}
namespace Sub1{
int solve(vector<int> y){
for(int i = 0; i < 3; ++i) {
if (y[i] > 0 && y[(i + 2) % 3] == 0)
return i;
}
return -1;
}
}
namespace Sub2{
int last_edge = -1;
int solve_internal(vector<int> y){
int mi = min_element(ALL(y)) - y.begin(), ma = max_element(ALL(y)) - y.begin();
if (last_edge == -1){
if (y[mi] == 1){
return y[mi];
}
else {
return y[ma];
}
}
else{
if (y[mi] == 0 && y[ma] == 0){
return -1;
}
else if (y[mi] == 0) return ma;
else {
if (y[ma] > 1) return mi;
else{ // y[0] = y[1] = 1
y[last_edge]++;
mi = min_element(ALL(y)) - y.begin();
return mi;
}
}
}
}
int solve(vector<int> y){ // wrapper
int ans = solve_internal(y);
if (ans != -1) last_edge = ans;
return ans;
}
}
int Move(vector<int> y){
if (current_subtask == 1) return Sub1::solve(y);
return Sub2::solve(y);
}
// int main(void){
// ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
// return 0;
// }
