#include <bits/stdc++.h>
#include "split.h"
#define f first
#define s second
#define ent '\n'
//#define int long long
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")
//typedef long double ld;
typedef long long ll;
using namespace std;
struct node{double x,y;};
//double len(node a,node b)
//{return sqrt((a.x-b.x)*(a.x-b.y)+(a.y-b.y)*(a.x-b.y));}
struct seg{
int m1,m2,sum,cnt;
};
const string out[2]={"No\n","Yes\n"};
const ll dx[]={0,0,1,-1,-1,1,1,-1};
const ll dy[]={1,-1,0,0,-1,1,-1,1};
const int md=998244353;
const int mod=1e9+7;
const int mx=1e6+1;
const int tst=1e5;
const bool T=0;
vector<int> g[mx];
bool used[mx];
int ans[mx];
int n,m,k;
int A,B,C;
int cnt;
void dfs(int v){
used[v]=1;
cnt++;
if(cnt<=A){
ans[v]=1;
}
else if(cnt<=A+B){
ans[v]=2;
}
else{
ans[v]=3;
}
for(int to:g[v]){
if(!used[to]){
dfs(to);
}
}
}
vector<int> find_split(int N, int a, int b, int c, vector<int> p, vector<int> q){
n=N;
m=p.size();
A=a,B=b,C=c;
bool ok=1;
for(int i=0;i<p.size();i++){
p[i]++;
q[i]++;
g[p[i]].push_back(q[i]);
g[q[i]].push_back(p[i]);
}
for(int i=1;i<=n;i++){
if(g[i].size()>2){
ok=0;
}
}
if(ok){
dfs(1);
vector<int> v;
for(int i=1;i<=n;i++){
v.push_back(ans[i]);
}
return v;
}
}
