#include "split.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define pb push_back
#define REP(i,n) for(int i = 0; i < n; i++)
#define FOR(i,a,b) for(int i = a; i < b; i++)
#define pii pair<int,int>
#define F first
#define S second
using namespace std;
const int MX = 200005;
vi g[MX],adj[MX];
int par[MX],dep[MX];
bitset<MX> vis;
void dfs(int u,int p,int d = 0){
// cout << u << " " << p << endl;
par[u] = p;
vis[u] = 1;
dep[u] = d;
for(auto v:g[u]){
if(vis[v]) continue;
adj[u].pb(v);
par[v] = u;
dfs(v,u,d-1);
}
}
vi find_split(int n, int a, int b, int c, vi p, vi q) {
REP(i,(int)p.size()){
g[p[i]].pb(q[i]);
g[q[i]].pb(p[i]);
}
int mxd = 0;
int root = 0;
REP(i,n){
mxd = max(mxd,(int)g[i].size());
if(g[i].size() == 1) root = i;
}
dfs(root,root);
vi ans(n);
if(mxd == 2){
int cur = root,cnt = 0;
while(1){
if(cnt < a) ans[cur] = 1;
else if(cnt < a+b) ans[cur] = 2;
else ans[cur] = 3;
cnt++;
if(adj[cur].size()) cur = adj[cur][0];
else break;
}
return ans;
}
if(a == 1){
vector<pii> v;
REP(i,n) v.pb({dep[i],i});
sort(v.begin(),v.end());
REP(i,n){
if(i == 0) ans[v[i].S] = 1;
else if(i <= b) ans[v[i].S] = 2;
else ans[v[i].S] = 3;
}
}
return ans;
}
