#include "islands.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
//#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9;
std::variant<bool, std::vector<int>> find_journey(
int N, int M, std::vector<int> U, std::vector<int> V) {
assert(N == 2);
int go = 0,come = 0;
for (int i = 0;i<M;i++) {
if (U[i] == 0) go++;
else come++;
}
if (come && go >= 3) return vi{0,0,0,0,0,0,0,0,0,0};
if (come >= 2 && go >= 2) return vi{0,0,0,0,0,0,0,0};
return false;
}
