#include"longesttrip.h"
#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#define N 256
using namespace std;
int n;
bool check(int x,int y)
{
	return are_connected({x},{y});
}
vector<int>longest_trip(int SN, int D)
{
	vector<int>p;
	vector<int>q;
	n=SN;
    if (D==3)
	{
		for (int i=0;i<n;++i) p.push_back(i);
		return p;
	}
	else if (D==2)
	{
		if (!check(0,1)) p.push_back(0),p.push_back(2),p.push_back(1);
		else if (!check(0,2)) p.push_back(0),p.push_back(1),p.push_back(2);
		else p.push_back(1),p.push_back(0),p.push_back(2);
		for (int i=3;i<n;++i)
		{
			if (!check(p.back(),i)) reverse(p.begin(),p.end());
			p.push_back(i);
		}
		return p;
	}
}