#include "split.h"
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <array>
#include <iomanip>
using namespace std;
const int nax = (int)200'000;
vector<int>adj[nax];
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
vector<int>res(n);
for (int i = 0; i < a; i++)res[i] = 1;
for (int i = a; i < b + a; i++)res[i] = 2;
for (int i = b + a; i < c + b + a; i++)res[i] = 3;
return res;
}
