#include "islands.h"
#include <variant>
#include <vector>
#include <map>
using namespace std;
variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V)
{
if (N ==2)
{
vector<int>ind[2]={};
for (int i=0;i<M;i++)
ind[U[i]].push_back(i);
if (ind[0].size()>1&&ind[1].size())
{
vector<int>ans;
ans.push_back(ind[0][0]);
ans.push_back(ind[1][0]);
ans.push_back(ind[0][1]);
ans.push_back(ind[0][0]);
ans.push_back(ind[1][0]);
ans.push_back(ind[0][1]);
return ans;
}
else
return false;
}
map<pair<int,int>,int>ind;
for (int i=0;i<M;i++)
ind[{U[i],V[i]}]=i;
vector<int>ans;
ans.push_back({ind[{0,1}]});
ans.push_back({ind[{1,0}]});
ans.push_back({ind[{0,2}]});
ans.push_back({ind[{2,0}]});
ans.push_back({ind[{1,0}]});
ans.push_back({ind[{0,1}]});
ans.push_back({ind[{2,0}]});
ans.push_back({ind[{0,2}]});
return ans;
// return false;
}
