#include <bits/stdc++.h>
#include "islands.h"
using namespace std;
#define fi first
#define se second
typedef long long ll;
typedef long double ld;
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
int inf = 1e9;
#include <variant>
#include <vector>
variant<bool, vector<int>> find_journey( int n, int m, std::vector<int> u, std::vector<int> v) {
vector<pair<int, int>> ze;
for (int i = 0; i < m; i++) {
if (u[i] == 0) {
ze.push_back({i, v[i]});
}
}
if (ze.size() >= 2) {
int ze1 = ze[0].fi, ze2 = ze[1].fi;
int on1 = -1, on2 = -1;
for (int i = 0; i < m; i++) {
if (v[i] == 0 && u[i] == ze[0].se) {
on1 = i;
break;
}
}
for (int i = 0; i < m; i++) {
if (v[i] == 0 && u[i] == ze[1].se) {
on2 = i;
break;
}
}
return vector<int>({ze1, on1, ze2, on2, on1, ze1, on2, ze1});
} else {
return false;
}
}
