#include "split.h"
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=1e5+50;
const int mod=1e9+7;
using namespace std;
int sz[nmax],pr[nmax],a[5],b[5],n,nd,c1,c2,i,m,x,y,ts,ss[nmax],p[nmax];
vector<int>g[nmax],rs;
bitset<nmax>viz;
vector<pair<int,int> >vc;
void dfs(int x,int p)
{
sz[x]=1;
pr[x]=p;
for(int i=0;i<g[x].size();i++)
{
int y=g[x][i];
if(y==p)continue;
dfs(y,x);
sz[x]+=sz[y];
}
for(int i=1;i<=3;i++)
{
for(int j=1;j<=3;j++)
{
if(i==j)continue;
if(a[i]<=sz[x] && sz[x]<=a[i]+a[j])
{
nd=x;
c1=i;
c2=6-i-j;
}
}
}
}
void col(int x,int c)
{
if(!a[c])return;
rs[x-1]=c;
a[c]--;
viz[x]=1;
for(int i=0;i<g[x].size();i++)
{
int y=g[x][i];
if(y==pr[x] || viz[y])continue;
col(y,c);
}
}
int fnd(int x)
{
if(p[x]==x)return x;
return p[x]=fnd(p[x]);
}
void uni(int x,int y)
{
if(fnd(x)!=fnd(y))
{
g[x].pb(y);
g[y].pb(x);
x=fnd(x),y=fnd(y);
if(ss[x]<ss[y])swap(x,y);
p[y]=x;
ss[x]+=ss[y];
}
}
vector<int> find_split(int N,int A,int B,int C,vector<int>P,vector<int>Q)
{
srand(time(0));
n=N,b[1]=A,b[2]=B,b[3]=C,m=(int)P.size();
for(i=0;i<m;i++)
{
P[i]++,Q[i]++;
vc.pb(mkp(P[i],Q[i]));
}
ts=5000;
nd=-1;
while(ts--)
{
for(i=1;i<=n;i++)
{
g[i].clear();
viz[i]=0;
p[i]=i;
ss[i]=1;
}
for(i=1;i<=3;i++)a[i]=b[i];
random_shuffle(vc.begin(),vc.end());
for(i=0;i<m;i++)
{
x=vc[i].fr,y=vc[i].sc;
uni(x,y);
}
rs.clear();
for(i=1;i<=n;i++)rs.pb(0);
dfs(1,0);
if(nd!=-1)
{
col(nd,c1);
col(1,c2);
for(i=0;i<n;i++)if(!rs[i])rs[i]=6-c1-c2;
break;
}
}
return rs;
}
