#include <bits/stdc++.h>
#define ll int
#define sz(x) int(x.size())
#define forn(i,n) for(i=0; i<n; i++)
#define all(x) x.begin(),x.end()
#define pb push_back
#define mp make_pair
#define fr first
#define se second
using namespace std;
std::variant<bool, std::vector<int>> find_journey(
int N, int M, std::vector<int> U, std::vector<int> V) {
if(N==2)
return false;
ll ars[3][3], i;
for(i=0; i<M; i++)
{
if(U[i]<=2&&V[i]<=2)
{
ars[U[i]][V[i]]=i;
}
}
vector<int>ans={ars[0][1],ars[1][0],ars[0][2],ars[2][0],ars[1][0],ars[0][1],ars[2][0],ars[0][2]};
return ans;
}
