#include "islands.h"
#include "bits/stdc++.h"
using namespace std;
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
#ifdef DEBUG
auto& operator<<(auto& os, pair<auto, auto> &p) {
return os<<"("<<p.first<<", "<<p.second<<")";
}
auto& operator<<(auto& os, const auto& &v) {
os<<"{";
for(auto it=begin(v);it!=end(v);++it) {
if(it != begin(v)) os<<", ";
os<<(*it);
}
return os<<"}";
}
void dbg_out(auto... x) {
((cerr<<' '<<x), ...) << endl;
}
#define dbg(x..,) cerr<<"("<#x<"):", dbg_out(x);
#else
#define dbg(...)
#endif
variant<bool, vi> find_journey(int N, int M, vi U, vi V) {
if (N == 2) {
int cnt_0 = 0;
rep(i,0,M) cnt_0 += U[i] == 0;
return cnt_0 >= 2 && M - cnt_0 >= 1;
}
return true;
}
