#include "split.h"
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//Abdulhamid Han
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
int m,b[li],a[li],k,flag,t,vis[li],bb,say,visit[li],renk[li];
int cev;
PII pa[5];
string s;
vector<int> v[li];
vector<int> vv;
inline void dfs(int node,int der,int ind){
if(vis[node]==1)return ;
vis[node]=1;
for(int i=0;i<(int)v[node].size();i++){
int go=v[node][i];
dfs(go,der+1,ind);
}
if(visit[node]==0){
if(say>=bb)return ;
say++;
visit[node]=ind;
//~ cout<<say<<endl;
}
//~ renk[node]=ind;
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
pa[1].fi=a;
pa[1].se=1;
pa[2].fi=b;
pa[2].se=2;
pa[3].fi=c;
pa[3].se=3;
sort(pa+1,pa+3+1);
bb=pa[2].fi;
for(int i=0;i<(int)p.size();i++){
v[q[i]].pb(p[i]);
v[p[i]].pb(q[i]);
}
dfs(0,0,pa[2].se);
say=0;
bb=pa[1].fi;
memset(vis,0,sizeof(vis));
dfs(0,0,pa[1].se);
for(int i=0;i<n;i++){
if(visit[i]==0)visit[i]=pa[3].se;
vv.pb(visit[i]);
}
return vv;
}
