#include "longesttrip.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")

using namespace std;
using namespace __gnu_pbds;

#define lg long long
#define ordered_set	tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);


vector<lg> adj[257];
vector<int> ans, cur;
lg vis[257], bo = 0;

void dfs(lg src)
{
	vis[src] = true;
	// cout << "ENTER " << src << '\n';
	cur.push_back(src);
	if(cur.size() > (lg)ans.size())	ans = cur;
	if(bo)	reverse(adj[src].begin(), adj[src].end());
	for(auto it : adj[src])
	{
		if(vis[it])	continue;
		dfs(it);
	}
	cur.pop_back();
	// cout << "LEAVE " << src << '\n';
	return;
}

std::vector<int> longest_trip(int n, int d)
{
	for(int i = 0; i < n; i++)	adj[i].clear();
	ans.clear();
	for(int i = 0; i < n; i++)
	{
		for(int j = i+1; j < n; j++)
		{
			bool b = are_connected({i}, {j});
			if(b)
			{
				adj[i].push_back(j);
				adj[j].push_back(i);
			}
		}
	}
	for(int i = 0; i < n; i++)
	{
		dfs(i);
		memset(vis, 0, sizeof(vis));
	}
	bo = 1;
	for(int i = 0; i < n; i++)
	{
		dfs(i);
		memset(vis, 0, sizeof(vis));
	}
	bo = 0;
    return ans;
}
/*
1
5 1
1
1 1
0 0 1
0 0 0 1
*/