#include "islands.h"
#include <variant>
#include <bits/stdc++.h>
using namespace std;
#define ll int
#define sz(x) (ll)x.size()
#define F first
#define S second
#define MID ((l+r)/2)
#define pb push_back
#define dbg(x) cout<<#x<<": "<<x<<endl;
#define dbg2(x,y) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<endl;
#define dbg3(x,y,z) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<" "<<#z<<": "<<z<<endl;
#define dbg4(x,y,z,w) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<" "<<#z<<": "<<z<<" "<<#w<<": "<<w<<endl;
#define dbg5(x,y,z,w,q) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<" "<<#z<<": "<<z<<" "<<#w<<": "<<w<<" "<<#q<<": "<<q<<endl;
#define ins insert
typedef vector <ll> vi;
typedef pair <ll,ll> ii;
typedef vector <ii> vii;
#define MOD 1000002022
#define inf 1e9
vector <vi> adj;
variant<bool, vi> find_journey(int N, int M, vi U, vi V){
ll n = N, m = M;
ll c =0;
adj.assign(n, vi());
for (ll i=0; i<m;i++){
adj[U[i]].pb(V[i]);
if (U[i] == 0) c++;
}
if (c == 0) return false;
if (c>=2) return true;
return (sz(adj[adj[0][0]]) > 1);
}
