#include "longesttrip.h"
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<int, int> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000007;
vvi paths;
vi visited;
vi cur_path;
int node,dis;
void dfs(int pos,int height,vi cur){
if(visited[pos])return;
cur.pb(pos);
visited[pos] = 1;
if(dis < height){
dis = height;
node = pos;
cur_path = cur;
}
for(int a:paths[pos]){
dfs(a,height+1,cur);
}
}
vi longest_trip(int N, int D)
{
paths = vvi(N);
FOR(i,0,N){
FOR(j,i+1,N){
if(are_connected({i},{j})){
paths[i].pb(j);
paths[j].pb(i);
}
}
}
visited = vi(N,0);
vi possibles;
FOR(i,0,N){
if(visited[i])continue;
node = -1;
dis = -1;
vi cur;
dfs(i,1,cur);
if(node != -1)possibles.pb(node);
}
visited = vi(N,0);
int temp = -1;
vi ans;
for(int i:possibles){
node = -1;
dis = -1;
vi cur;
dfs(i,1,cur);
if(temp < dis){
temp = dis;
ans = cur_path;
}
}
return ans;
}
