// what is matter? never mind. 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include"longesttrip.h"
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
//#define int long long
#define ull unsigned long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 200005
#define inf 0x3f3f3f3f

int n;
int mp[260][260];

int Q(int i,int j){
	if(mp[i][j]!=-1)return mp[i][j];
	return mp[i][j]=mp[j][i]=are_connected({i},{j});
}
int Q(vi a,vi b){
	return are_connected(a,b);
}
void operator +=(vi&a,vi&b){
	for(int x:b) a.pb(x);
}

vi longest_trip(int N,int D)
{
	n=N;
	For(i,0,n-1)For(j,0,n-1)mp[i][j]=(i==j?0:-1);
	vi a,b; a.pb(0);
	For(i,1,n-1){
		if(Q(i,a.back())) a.pb(i);
		else if(b.size() && Q(i,b.back())) b.pb(i);
		else reverse(b.begin(),b.end()),a+=b,b.clear();
	}
	if(!b.size())return a;
	if(!Q(a,b))return a.size()>b.size()?a:b;
	if(Q(a[0],b[0])) return reverse(a.begin(),a.end()),a+=b,a;
	if(Q(a.back(),b[0])) return a+=b,a;
	if(Q(a[0],b.back())) return b+=a,b;
	if(Q(a.back(),b.back())) return reverse(a.begin(),a.end()),b+=a,b;
	assert(Q(a[0],a.back()));
	assert(Q(b[0],b.back()));
	For(i,0,(int)a.size()-1)
		For(j,0,(int)b.size()-1){
			if(Q(a[i],b[j])){
				rotate(a.begin(),a.begin()+i+1,a.end());
				rotate(b.begin(),b.begin()+j,b.end());
				return a+=b,a;
			}
		}
	assert(0);
}