#include "islands.h"
#include <variant>
#include <vector>
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define all(x) x.begin(),x.end()
typedef long long ll;
#define pb push_back
#define INF 9999999999999999
vector<vector<pair<int,int>>>g;
ll last=-1;
void dfs(int start, vector<int> &vis)
{
for(auto x:g[start])
if(vis[x.F]==-1)
{
vis[x.F]=start;
dfs(x.F,vis);
}
else
{
last=start;
break;
}
return ;
}
variant<bool, vector<int> > find_journey(int N, int M, vector<int> U, vector<int> V)
{
g.assign(N,vector<pair<int,int>>());
vector<int>c(N,0);
for(int i=0;i<M;i+=2)
g[U[i]].pb({V[i],i});
vector<int>vis(N,-1);
dfs(0,vis);
if(last==-1)
return false;
vector<int>v={0,1,0};
return v;
}
