#include "longesttrip.h"

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


// bool are_connected(std::vector<int> A, std::vector<int> B);

std::vector<int> longest_trip(int N, int D)
{
  if (D >= 2) {
    vector<int> us{0};
    for (int u = 1; u < N; ++u) {
      vector<int> fs(u);
      for (int j = 0; j < u; ++j) {
        fs[j] = are_connected({u}, {us[j]});
      }
      for (int j = 0; j < u - 1; ++j) if (fs[j] && fs[j + 1]) {
        us.insert(us.begin() + (j + 1), u);
        goto found;
      }
      {
        vector<int> vs{u};
        for (int j = 0; j < u; ++j) if (fs[j]) vs.push_back(us[j]);
        for (int j = u; --j >= 0; ) if (!fs[j]) vs.push_back(us[j]);
        us.swap(vs);
      }
     found:{}
    }
    return us;
  } else {
    assert(false);
  }
}