/**
* Author: Tenjin
* Created: 27.04.2022 18:58
* Why am I so stupid? :c
* Slishkom slab
**/
#include <bits/stdc++.h>
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse,-fgcse-lm")
#pragma GCC optimize("-ftree-pre,-ftree-vrp")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define ll long long
#define pr pair
#define vt vector
#define ff first
#define ss second
#define sz(a) (int)a.size()
#define pb push_back
#define pf push_front
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<typename T> T get_rand(T l, T r) {
random_device rd;
mt19937 gen(rd());
return uniform_int_distribution<T>(l, r)(gen);
}
template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(array<A, S>& a);
template<class T> void read(T& x) { cin >> x; }
void read(double& d) { string t; read(t); d = stod(t); }
void read(long double& d) { string t; read(t); d = stold(t); }
template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); }
template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); }
template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); }
string to_string(char c) { return string(1, c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; }
template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; }
template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; }
template<class A> void write(A x) { cout << to_string(x); }
template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); }
void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); }
void freop(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
const int MOD = 1e9 + 7;
const ll INF = 1e14;
const int M = 4e5 + 5;
const double long pi = acos(-1);
const double long eps = 1e-12;
const int sq = 700;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
/* ll vs int*/
const int N = 1e6 + 5;
pr<int, int> col[5];
vt<int> ans;
vt<vt<int>> g, g1;
int n, m;
int raz[N], fup[N], tin[N], timer, par[N];
void dfs(int v, int p = -1) {
raz[v] = 1;
tin[v] = fup[v] = ++timer;
par[v] = p;
for(auto to : g[v]) {
if(to == p) continue;
if(!raz[to]) {
dfs(to, v);
fup[v] = min(fup[v], fup[to]);
raz[v] += raz[to];
g1[v].pb(to);
}
else fup[v] = min(fup[v], tin[to]);
}
}
int best, ost = MOD;
void dfs1(int v, int p = -1) {
if(raz[v] >= col[0].ff) {
if(ost > raz[v] - col[0].ff) {
ost = raz[v] - col[0].ff;
best = v;
}
}
for(auto to : g1[v]) {
if(to == p) continue;
dfs1(to, v);
}
}
int curcolor, cur;
void color(int v, bool ok) {
if(!cur) return;
//print(v);
if(ans[v] == 0) {
cur--;
ans[v] = curcolor;
}
if(ok) {
for(auto to : g1[v]) {
if(cur) color(to, ok);
}
}
else {
for(auto to : g[v]) {
if(ans[to] != col[0].ss && ans[to] != col[1].ss) {
color(to, ok);
}
}
}
}
vt<int> find_split(int xN, int xA, int xB, int xC, vt<int> p, vt<int> q) {
n = xN;
m = sz(q);
col[0] = {xA, 1};
col[1] = {xB, 2};
col[2] = {xC, 3};
ans.resize(n);
sort(col, col + 3);
g.resize(n);
g1.resize(n);
for(int i = 0; i < m; ++i) {
g[p[i]].pb(q[i]);
g[q[i]].pb(p[i]);
}
dfs(0);
/* for(int i = 0; i < n; ++i) {
for(auto num : g1[i]) print(i, num);
}*/
dfs1(0);
if(n - raz[best] >= col[1].ff) {
curcolor = col[0].ss, cur = col[0].ff;
//print(best, cur, curcolor);
color(best, 1);
curcolor = col[1].ss, cur = col[1].ff;
// print(par[best], cur, curcolor);
color(par[best], 0);
for(auto &num : ans) {
if(num == 0) num = col[2].ss;
}
return ans;
}
else {
curcolor = col[1].ss, cur = col[1].ff;
ans[best] = curcolor;
cur--;
for(auto to : g1[best]) {
if(cur && fup[to] > tin[best]) {
color(best, 1);
}
}
for(auto to : g1[best]) {
if(cur && fup[to] <= tin[best]) {
color(best, 1);
}
}
curcolor = col[0].ss, cur = col[0].ff;
if(par[best] != -1) color(par[best], 0);
for(auto &num : ans) {
if(cur) num = 0;
else {
if(num == 0) num = col[2].ss;
}
}
}
return ans;
}
/*
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
//freop("");
int t = 1;
//read(t);
for (int i = 1; i <= t; ++i) {
//write("Case #" + to_string(i) + ": ");
solve();
}
return 0;
}*/
