#include <iostream>
#include <vector>
#include <queue>
#include <cassert>
#include <string>
#include <set>
using namespace std;
#define f first
#define s second
#define pb push_back
#define ar array
#define all(x) x.begin(), x.end()
#define siz(x) (int)x.size()
#define FOR(x, y, z) for(int x = (y); x < (z); x++)
#define ROF(x, z, y) for(int x = (y-1); x >= (z); x--)
#define F0R(x, z) FOR(x, 0, z)
#define R0F(x, z) ROF(x, 0, z)
#define trav(x, y) for(auto&x:y)
using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;
template<class T> inline bool ckmin(T&a, T b) {return b < a ? a = b, 1 : 0;}
template<class T> inline bool ckmax(T&a, T b) {return b > a ? a = b, 1 : 0;}
const char nl = '\n';
const int mxN = 20010;
const int MOD = 1e9 + 7;
const long long infLL = 1e18;
int n, m, a, b, d[mxN];
vi U, V, adj[mxN], res; vpii g[mxN];
queue<int> q;
// set<string> good{"01001", "10110", "00110", "01101", "11010", "10100"};
vector<int> list = {0, 1, 0, 0, 1, 1};
int amt[3] = {0, 1, 2};
void dfs(int u, int cur_edge, int cur = 0){
if(cur_edge!=-1) res[cur_edge] = list[cur];
trav(v, g[u]){
if(cur_edge==v.s) continue;
if(siz(g[u]) == 2 && u != 0){
dfs(v.f, v.s, (cur+1)%6);
}
else{
dfs(v.f, v.s, list[cur]^1);
}
}
}
vi Mark(int N, int M, int A, int B, vi Uu, vi Vv){
U = Uu; V = Vv; n = N; m = M; a = A; b = B;
if(a==2){
res.resize(m);
// 0 -> 1 -> 0 -> 0 -> 1 -> 1 -> 0 -> 1 -> 0 -> 0 -> 1 -> 1
F0R(i, m){
g[U[i]].pb({V[i], i});
g[V[i]].pb({U[i], i});
}
dfs(0, -1, 0);
return res;
}
else{
res.resize(m);
F0R(i, n) d[i] = MOD;
F0R(i, m){
adj[U[i]].pb(V[i]);
adj[V[i]].pb(U[i]);
}
d[0] = 0;
q.push(0);
while(!q.empty()){
int u = q.front(); q.pop();
trav(v, adj[u]){
if(ckmin(d[v], d[u]+1)){
q.push(v);
}
}
}
F0R(i, m){
// we want to give them the value of the vertex with the higher value so that we know where to go
if(d[U[i]]<d[V[i]])
swap(U[i], V[i]);
if(d[U[i]]==d[V[i]]){
res[i] = amt[d[U[i]]%3];
}
else{
res[i] = amt[d[V[i]]%3];
// if we have distance 2 and 3
// we will at 3 see that we have 2
}
}
return res;
}
}
#ifdef ACMX
int32_t main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int N, M, A, B; cin >> N >> M >> A >> B;
U.resize(M);
V.resize(M);
F0R(i, M){
cin >> U[i] >> V[i];
}
vi res = Mark(N, M, A, B, U, V);
trav(x, res){
cout << x << " ";
}
cout << nl;
return 0;
}
#endif
#include <vector>
#include <iostream>
#include <queue>
#include <cassert>
#include <set>
#include <algorithm>
using namespace std;
#define f first
#define s second
#define pb push_back
#define ar array
#define all(x) x.begin(), x.end()
#define siz(x) (int)x.size()
#define FOR(x, y, z) for(int x = (y); x < (z); x++)
#define ROF(x, z, y) for(int x = (y-1); x >= (z); x--)
#define F0R(x, z) FOR(x, 0, z)
#define R0F(x, z) ROF(x, 0, z)
#define trav(x, y) for(auto&x:y)
using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;
template<class T> inline bool ckmin(T&a, T b) {return b < a ? a = b, 1 : 0;}
template<class T> inline bool ckmax(T&a, T b) {return b > a ? a = b, 1 : 0;}
const char nl = '\n';
const int mxN = 2e5 + 10;
const int MOD = 1e9 + 7;
const long long infLL = 1e18;
vector<int> list = {0, 1, 0, 0, 1, 1};
vector<int> cur;
vector<int> seen;
int a, b; int choose = 0, last = -1, going_up =0;
set<vector<int>> lists {
{1,1,0,0,1},
{1,0,0,1,0},
{0,0,1,0,1},
{0,1,0,1,1},
{1,0,1,1,0},
{0,1,1,0,0},
};
int lst = -1;
void Init(int A, int B){
a = A, b = B;
}
int Move(vi y){
if(a > 2){
if(y[0] == 0 && y[1] == 0 && y[2] == 0){
assert(false);
}
else if(y[0] == 0 && y[1] == 0){
return 2;
}
else if(y[1] == 0 && y[2] == 0){
return 0;
}
else if(y[2] == 0 && y[0] == 0){
return 1;
}
else if(y[0] == 0){
return 1;
}
else if(y[1] == 0){
return 2;
}
else if(y[2] == 0){
return 0;
}
else{
assert(false);
}
}
else{
int A = a;
int B = b;
vector<int> new_y = y;
if (~last) new_y[last]++;
int deg = new_y[0] + new_y[1];
if (deg != 2) going_up = true;
if (going_up) {
if (deg == 1) {
if (last == -1) FOR(i, 0, A) if (y[i]) return last = i;
return -1;
} else if (deg == 2) {
FOR(i, 0, A) if (y[i]) return last = i;
} else {
FOR(i, 0, A) if (new_y[i] == 1) {
if (!y[i]) return -1;
return last = i;
}
}
} else {
if (~last) {
FOR(i, 0, A) if (y[i]) {
seen.push_back(i);
if (seen.size() < 5) return last = i;
else {
going_up = true;
for (vector<int> v : lists)
if (v == seen) return last = i;
return -1;
}
}
} else {
FOR(i, 0, A) if (y[i]) {
seen.push_back(i);
y[i]--;
FOR(j, 0, A) if (y[j]) {
seen.push_back(j);
return last = j;
}
}
}
}
}
}
#ifdef ACMX
int32_t main(){
ios_base::sync_with_stdio(0); cin.tie(0);
return 0;
}
#endif
