#include <bits/stdc++.h>
#include "islands.h"
using namespace std;
template <typename T>
using v = vector<T>;
using pii = pair<int, int>;
using ll = long long;
#define rep(i, k, n) for (int i = k; i < n; i++)
std::variant<bool, v<int>> find_journey(int N, int M, v<int> U, v<int> V) {
v<int> idx01;
v<int> idx10;
rep(i, 0, M) {
if (U[i] == 0 && V[i] == 1) idx01.push_back(i);
else idx10.push_back(i);
}
if (idx01.size() >= 2 && idx10.size() >= 1) {
return v<int>{idx01[0], idx10[0], idx01[1], idx01[0], idx10[0], idx01[1]};
}
else return false;
}
