#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<ll,ll> pl;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define po pop_back
#define pb push_back
#define mk make_pair
#define mt make_tuple
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define BOOST ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18
#define MIN -1e18
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
#define read(x) scanf("%lld",&x);
#define print(x) printf("%lld ",x);
#define endl '\n';
// typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll n,m,ans,mid,mn,mx,T,sum,h1,h2,e[1234567],b[1234567],c[1234567],d[1<<20],k,i,j,l,r,h,a[1234567],w,x,y,z,res,par[1234567],cnt,sz[1234567];
bool used[1234567];
vl v[1234567],vec1;
char s1[1234567],s[1234567],ss[1234567];
vector<pl> vp[1234567];
bool ok;
map<ll,ll> mp;
ll c1[2234][2234],c2[1234][1234];
char ch[2234][2234];
ll dx[4]={0,0,1,-1},dy[4]={1,-1,0,0};
vl vec;
void dfs(int x){
used[x]=1;
for(auto u:v[x]){
if(used[u]==0)dfs(u);
}
vec.pb(x);
}
vector<int> find_split(int n,int a,int b,int c, vector<int>v1,vector<int>v2){
rep(i,0,v1.size()-1){
v[v1[i]].pb(v2[i]);
v[v2[i]].pb(v1[i]);
}
if(v1.size()==n-1){
rep(i,0,n-1){
if(v[i].size()==1){
dfs(i);
vector<int> ans(n);
rep(i,0,a-1){
ans[vec[i]]=1;
}
rep(i,a,a+b-1){
ans[vec[i]]=2;
}
rep(i,a+b,n-1){
ans[vec[i]]=3;
}
return ans;
}
}
}
dfs(0);
vector<int> ans(n);
rep(i,0,a-1){
ans[vec[i]]=1;
}
rep(i,a,a+b-1){
ans[vec[i]]=2;
}
rep(i,a+b,n-1){
ans[vec[i]]=3;
}
return ans;
}
