#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"
vector<int> Mark(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(1);
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);
if (dis[u] > dis[v]){
ans.push_back(dis[u] % 3);
}
else{
ans.push_back((dis[u] + 1) % 3);
}
}
return ans;
}
// 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()
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 "Catherine.h"
void Init(int A, int B){
}
int Move(vector<int> y){
vector<int> non_zero;
for(int i = 0; i < (int) y.size(); ++i) if (y[i] != 0)
non_zero.push_back(i);
if (non_zero.size() == 1){
return y[non_zero[0]];
}
else if (non_zero.size() == 0 || non_zero.size() == 3) {
assert(false);
return -1;
}
else{
if (non_zero[0] + 1 == non_zero[1]) {
return non_zero[0];
}
return non_zero[1];
}
}
// int main(void){
// ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
// return 0;
// }
