#include "islands.h"
#include <variant>
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
int n;
vector<pair<int,int>> adj[maxn];
int a[maxn][maxn];
std::variant<bool, vector<int>> find_journey(
int N, int M, vector<int> U, vector<int> V) {
n = N;
for (int i=0;i<n;i++) for (int j=0;j<n;j++) a[i][j] = 0;
for (int i=0;i<M;i++) {
adj[U[i]].push_back({V[i], i});
a[U[i]][V[i]] = i;
}
if (adj[0].size() <= 1) return false;
if (adj[0].size() >= 2) {
int v1 = adj[0][0].first, v2 = adj[0][1].first;
return (vector<int>){a[0][v1], a[v1][0], a[0][v2], a[v2][0], a[v1][0], a[0][v1], a[v2][0], a[0][v2]};
}
return false;
}
