#include <cstdio>
#include <cassert>
#include <bits/stdc++.h>
#define Int long long
#define fore(i , n) for(int i = 0 ; i<n;i++)
#define pb push_back
#define forn(i , x , y) for(int i = x ; i >= y; i--)
using namespace std;
vector<int> ans;
vector<vector<int>>adj;
vector<pair<int , int>> comp;
const int N = 2e5 + 10;
int sz[N];
void dfs_paint(int x , int p , int c)
{
if(ans[x])
return ;
ans[x] = c;
for(auto u : adj[x])
{
if(u == p)
continue;
dfs_paint(u , x , c);
}
}
void dfs(int x , int p , int n)
{
sz[x] = 1;
for(auto u : adj[x])
{
if(u == p)
continue;
dfs(u , x , n);
sz[x]+=sz[u];
}
fore(i , 3)
{
if(n - sz[x] >= min_element(comp.begin() , comp.end())->first && sz[x] == comp[i].first)
{
dfs_paint(x, p , comp[i].second);
sz[x] = 0;
comp[i].first = 1e9;
}
}
}
struct DSU
{
vector<int> e;
DSU(int n)
{
e.assign(n , -1);
}
int get(int x)
{
return (e[x] < 0 ? x : e[x] = get(e[x]));
}
bool unite(int u , int v)
{
u = get(u);
v = get(v);
if(u == v)
return 0;
if(e[u] > e[v])
swap(u , v);
e[u]+=e[v];
e[v] = u;
return 1;
}
};
vector<int> find_split(int n, int _a , int _b , int _c , vector<int> p , vector<int> q)
{
comp = {{_a , 1} , {_b , 2} , {_c , 3}};
sort(comp.begin() , comp.end());
ans.assign(n , 0);
adj.assign(n , {});
DSU dsu(n);
int m = (int)p.size();
fore(i , m)
{
if(dsu.unite(p[i] , q[i]))
{
adj[p[i]].pb(q[i]);
adj[q[i]].pb(p[i]);
}
}
dfs(0 , -1 , n);
fore(i , n)
{
if(!ans[i])
return vector<int>(n , 0);
}
return ans;
}
//int main() {
// int n, m, A, B, C;
// assert(5 == scanf("%d%d%d%d%d", &n, &m, &A, &B, &C));
// vector<int> p(m), q(m);
// for (int i=0; i<m; i++)
// assert(2 == scanf("%d%d", &p[i], &q[i]));
// fclose(stdin);
//
// vector<int> result = find_split(n, A, B, C, p, q);
//
// for (int i=0; i<(int)result.size(); i++)
// printf("%s%d", ((i>0)?" ":""), result[i]);
// printf("\n");
// fclose(stdout);
// return 0;
//}
