#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define f0r(i, n) for (auto i = 0; i < (n); ++i)
#define fnr(i, n, k) for (auto i = (n); i < (k); ++i)
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define F first
#define S second
#define ctn(x) cout << x << '\n'
#define forl(a, l) for (auto a : l)
#define ctl(l) for (auto &a : (l)) cout << a << ' '; cout << endl;
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define ub(v, x) (upper_bound(all(v), x) - begin(v))
#define pq priority_queue
template <class T>
using V = vector<T>;
using ll = long long;
using vi = V<int>;
using vl = V<ll>;
using pi = pair<int, int>;
using ti = tuple<int, int, int>;
using Adj = V<vi>;
using vvi = V<vi>;
#include "longesttrip.h"
std::vector<int> longest_trip(int N, int D)
{
if (D == 3) {
vi A(N);
iota(all(A), 0);
return A;
}
if (D == 2) {
vi A;
A.pb(0);
set<int> res;
fnr(i, 1, N) res.insert(i);
while (res.size() >= 2) {
int x = *res.begin(), y = *next(res.begin());
A.pb(are_connected({A.back()}, {x}) ? x : y);
res.erase(A.back());
}
int x = *res.begin();
if (are_connected({ A.back() }, {x})) A.pb(x);
else {
reverse(all(A));
A.pb(x);
}
return A;
}
vi A{0}, B{1};
bool con = 1;
fnr(i, 2, N) {
if (are_connected({i}, {A.back()})) {
A.pb(i);
con = 1;
} else if (con && are_connected({i}, {B.back()})) {
B.pb(i);
con = 0;
} else {
A.insert(A.end(), all(B));
B = {i};
con = 0;
}
}
return A.size() > B.size() ? A : B;
}
