#include "split.h"
#include<bits/stdc++.h>
#define f0r(i,n) for(int i = 0; i<n; i++)
#define FOR(i, k, n) for(int i = k; i<n; i++)
#define pb push_back
#define vi vector<int>
#define vout(v) for(auto u : v)cout<<u<<' '; cout<<'\n';
#define dout(x) cout<<x<<' '<<#x<<'\n';
#define pii pair<int,int>
#define vpii vector<pii>
#define vb vector<bool>
#define mp make_pair
using namespace std;
const int mxn = 2e5 + 5;
vector<vi> adj(mxn);
int m;
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
m = p.size();
vi deg(n);
f0r(i,m){
int x = p[i]; int y = q[i];
adj[x].pb(y);
adj[y].pb(x);
deg[x]++; deg[y]++;
}
vi ans(n, 3);
if(a == 1){
queue<int>q;
q.push(0);
int cnt = 0;
vb vis(n);
vis[0] = 1;
while(!q.empty() && cnt < b){
int node = q.front(); q.pop();
cnt++;
ans[node] = 2;
for(auto u : adj[node]){
if(vis[u])continue;
vis[u] = 1;
q.push(u);
}
}
f0r(i,n){
if(ans[i] == 3){
ans[i] = 1;
break;
}
}
}
else{
int st = -1;
f0r(i, n){
if(deg[i] == 1)st = i;
}
if(st == -1)st = 0;
queue<int>q;
vb vis(n);
vis[st] = 1;
q.push(st);
int cnt = 1;
ans[st] = 1;
while(!q.empty() && cnt < a){
int node = q.front(); q.pop();
for(auto u : adj[node]){
if(vis[u])continue;
vis[u] = 1;
cnt++;
ans[u] = 1;
q.push(u);
break;
}
}
cnt = 0;
while(!q.empty() && cnt < b){
int node = q.front(); q.pop();
for(auto u : adj[node]){
if(vis[u])continue;
vis[u] = 1;
cnt++;
ans[u] = 2;
q.push(u);
}
}
}
return ans;
}
