#include <bits/stdc++.h>
using namespace std;
#define INF 1000000000000000000
#define MOD 998244353
vector<int> adj[100000], grpv[100001];
set<pair<int, tuple<int, int, int>>> adj2[100000];
vector<int> path, res;
vector<pair<int, int>> t1;
int sz[100000], grp[100001], d, e, c1 = -1, c2 = -1, cnt;
bool v[100000];
int size(int x, int g) {
v[x] = 1; sz[x] = 1; grp[x] = g;
if(g != -1) grpv[g].push_back(x);
for(int i : adj[x]) if(!v[i]) {
if(g == -1) sz[x] += size(i, i);
else sz[x] += size(i, g);
}
return sz[x];
}
int centroid(int x, int n) {
v[x] = 1;
for(int i : adj[x]) if(!v[i] && sz[i] > n/2) return centroid(i, n);
return x;
}
bool dfs(int x, int sz, int _c1, int _c2) {
v[x] = 1;
cout << "dfs " << x << " " << sz << " " << _c1 << " " << _c2 << endl;
if(sz >= d) {
c1 = _c1; c2 = _c2;
path.push_back(x);
return true;
}
for(auto i : adj2[x]) if(!v[i.first]) {
if(dfs(i.first, sz+get<0>(i.second), get<1>(i.second), get<2>(i.second))) {
path.push_back(x);
return true;
}
}
return false;
}
void dfs2(int x) {
v[x] = 1;
if(cnt == 0) return;
res[x] = t1[0].second;
cnt--;
for(int i : adj[x]) if(!v[i] && grp[i] == grp[x]) dfs2(i);
}
void dfs3(int x) {
if(cnt == 0) return;
res[x] = t1[1].second;
cnt--;
for(int i : adj[x]) if(res[i] == 0) dfs3(i);
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
for(int i = 0; i < n; i++) res.push_back(0);
for(int i = 0; i < p.size(); i++) {
adj[p[i]].push_back(q[i]);
adj[q[i]].push_back(p[i]);
}
t1 = {{a, 1}, {b, 2}, {c, 3}};
sort(t1.begin(), t1.end());
d = t1[0].first; e = t1[1].first;
size(0, n);
memset(v, 0, sizeof(v));
int cen = centroid(0, n);
memset(v, 0, sizeof(v));
size(cen, -1);
for(int i : adj[cen]) if(sz[i] >= d) {
memset(v, 0, sizeof(v));
cnt = d;
dfs2(i);
cnt = e;
dfs3(cen);
for(int j = 0; j < n; j++) if(res[j] == 0) res[j] = t1[2].second;
return res;
}
return res;
}
