#include <bits/stdc++.h>
using namespace std;
variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) {
if (N == 2) {
vector<int> rig, lef;
for (int i = 0; i < M; ++i) {
if (U[i] == 0) {
lef.push_back(i);
} else {
rig.push_back(i);
}
}
if (lef.size() < 2 || rig.empty()) {
return false;
}
return vector<int>({lef[0], rig[0], lef[1], lef[0], rig[0], lef[1]});
}
map<pair<int, int>, int> id;
for (int i = 0; i < M; ++i) {
id[{U[i], V[i]}] = i;
}
return vector<int>({id[{0, 1}], id[{1, 2}], id[{2, 0}], id[{0, 2}], id[{2, 1}], id[{1, 0}],
id[{1, 0}], id[{2, 1}], id[{0, 2}], id[{2, 0}], id[{1, 2}], id[{0, 1}]});
}
#ifdef MACOS_LOCAL
#include "grader.cpp"
#endif
