#include "islands.h"
#include <cassert>
#include <cstdio>
#include <variant>
#include <vector>
#include <algorithm>
using namespace std;
variant<bool, vector<int>> find_journey(int N, int M, std::vector<int> U, std::vector<int> V) {
if (N == 2){
if(count(U.begin(), U.end(), 0) >= 2 && count(U.begin(), U.end(), 1) >= 1){
vector<pair<int, int>> ans(M);
for(int i = 0; i < M; i ++){
ans[i] = {U[i], i};
}
sort(ans.begin(), ans.end());
vector<int> ret = {ans[0].second, ans.back().second, ans[1].second, ans[0].second, ans.back().second, ans[1].second};
return ret;
}
return false;
}
if(N * (N - 1) == M){
vector<vector<pair<int, int>>> tree(N);
for(int i = 0; i < M; i ++){
tree[U[i]].push_back({V[i], i});
sort(tree[U[i]].begin(), tree[U[i]].end());
}
vector<int> ret = {tree[0][0].second, tree[1][0].second, tree[0][1].second, tree[2][0].second, tree[1][0].second, tree[0][0].second, tree[2][0].second, tree[0][1].second};
return ret;
}
return false;
}
