#include <bits/stdc++.h>
#include "split.h"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
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(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll 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);}
double rngesus_d(double l, double r){
double cur = rngesus(0, MASK(60) - 1);
cur /= MASK(60) - 1;
return l + cur * (r - l);
}
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());
}
const int N = 2e5 + 69;
namespace Sub1{
struct DSU{
int n;
vector<int> parent, sz;
DSU(int _n){
n = _n;
parent.resize(n); sz.resize(n, 1);
for(int i = 0; i<n; ++i) parent[i] = i;
}
int find_set(int u){return (u == parent[u]) ? u : (parent[u] = find_set(parent[u]));}
bool same_set(int u, int v){return find_set(u) == find_set(v);}
bool join_set(int u, int v){
u = find_set(u), v = find_set(v);
if (u != v){
if (sz[u] < sz[v]) swap(u, v);
parent[v] = u;
sz[u] += sz[v];
return true;
}
return false;
}
int get_size(int u){return sz[find_set(u)];}
};
int m;
vector<int> graph[N];
int sz[N], parent[N];
vector<int> ans;
void dfs(int u, int p){
sz[u] = 1;
parent[u] = p;
for(int v: graph[u]) if (v != p){
dfs(v, u);
sz[u] += sz[v];
}
}
void flood_fill(int u, int p, int &a, int b){
if (a == 0) return;
a--;
ans[u] = b;
for(int v: graph[u]) if (v != p){
flood_fill(v, u, a, b);
}
}
vector<int> solve(int n, int a, int b, int c, vector<int> p, vector<int> q){
array<int, 4> cc_size = {{0, a, b, c}};
m = p.size();
DSU mst(n);
for(int i = 0; i<m; ++i){
int u = p[i], v = q[i];
if (mst.join_set(u, v)){
graph[u].push_back(v);
graph[v].push_back(u);
}
}
dfs(0, 0);
ans.resize(n, 0);
bool found = false;
for(int i = 1; i<n; ++i){
int part1 = sz[i], part2 = n - sz[i];
array<int, 3> perm = {{1, 2, 3}};
do{
if (part1 >= cc_size[perm[0]] && part2 >= cc_size[perm[1]]){
found = true;
fill(ALL(ans), perm[2]);
part1 = cc_size[perm[0]], part2 = cc_size[perm[1]];
flood_fill(i, parent[i], part1, perm[0]);
flood_fill(parent[i], i, part2, perm[1]);
break;
}
} while(next_permutation(ALL(perm)));
if (found) break;
}
return ans;
}
}
namespace Sub2{
int m;
vector<int> graph[N];
vector<int> ans;
int cnt;
void dfs(int u){
if (cnt == 0) return;
cnt--;
ans[u] = 2;
for(int v: graph[u]) if (ans[v] == 0){
dfs(v);
}
}
vector<int> solve(int n, int a, int b, int c, vector<int> p, vector<int> q){
m = p.size();
for(int i = 0; i<m; ++i){
int u = p[i], v = q[i];
graph[u].push_back(v);
graph[v].push_back(u);
}
cnt = b;
ans.resize(n, 3);
dfs(0);
for(int i: ans) if (i == 2) cnt++;
if (cnt != b) exit(1);
for(int i = 0; i<n; ++i) if (ans[i] == 3) {
ans[i] = 1;
break;
}
return ans;
}
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
// if (a == 1) return Sub2::solve(n, a, b, c, p, q);
return Sub1::solve(n, a, b, c, p, q);
}
// int main(void){
// ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
// clock_t start = clock();
// int n, m; cin >> n >> m;
// int a, b, c; cin >> a >> b >> c;
// vector<int> p(m), q(m);
// for(int i= 0; i<m; ++i) cin >> p[i] >> q[i];
// vector<int> ans = find_split(n, a, b, c, p, q);
// printArr(ans);
// cerr << "Time elapsed: " << clock() - start << " ms\n";
// return 0;
// }
