/*************************************
* author: marvinthang *
* created: 06.03.2023 15:25:06 *
*************************************/
#include "scales.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define left ___left
#define right ___right
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define MASK(i) (1LL << (i))
#define BIT(x, i) ((x) >> (i) & 1)
#define __builtin_popcount __builtin_popcountll
#define ALL(v) (v).begin(), (v).end()
#define REP(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define REPD(i, n) for (int i = (n); i--; )
#define FOR(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define FORD(i, b, a) for (int i = (b), _a = (a); --i >= _a; )
#define FORE(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORDE(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
#define scan_op(...) istream & operator >> (istream &in, __VA_ARGS__ &u)
#define print_op(...) ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
#include "debug.h"
#else
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define DB(...) 23
#define db(...) 23
#define debug(...) 23
#endif
template <class T> scan_op(vector <T>) { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> scan_op(pair <U, V>) { return in >> u.fi >> u.se; }
template <class U, class V> print_op(pair <U, V>) { return out << '(' << u.first << ", " << u.second << ')'; }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")"; else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
// end of template
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long rand(long long l, long long h) { return uniform_int_distribution <long long> (l, h) (rng); }
#define Bitset bitset<720>
vector <vector <int>> ask, perms, pos;
void init(int T) {
vector <int> v {1, 2, 3, 4, 5, 6};
do {
perms.push_back(v);
pos.push_back(vector<int>(7));
REP(i, 6) pos.back()[perms.back()[i]] = i;
} while (next_permutation(ALL(v)));
FOR(a, 1, 7) FOR(b, a + 1, 7) FOR(c, b + 1, 7) {
REP(i, 3) ask.push_back(vector<int>{-i, a, b, c});
FOR(d, 1, 7) if (d != a && d != b && d != c) ask.push_back(vector<int>{d, a, b, c});
}
}
int Ask(const vector <int> &v) {
if (v[0] == -0) return getLightest(v[1], v[2], v[3]);
if (v[0] == -1) return getMedian(v[1], v[2], v[3]);
if (v[0] == -2) return getHeaviest(v[1], v[2], v[3]);
return getNextLightest(v[1], v[2], v[3], v[0]);
}
int Ask(int p, vector <int> v) {
sort(1 + ALL(v), [&] (int a, int b) { return pos[p][a] < pos[p][b]; });
if (v[0] < 1) {
if (v[0] == -0) return v[1];
if (v[0] == -1) return v[2];
return v[3];
}
FOR(i, 1, 4) if (pos[p][v[i]] > pos[p][v[0]]) return v[i];
return v[1];
}
struct Cmp {
bool operator() (const Bitset &a, const Bitset &b) const {
REP(i, 720) if (a[i] != b[i]) return a[i] < b[i];
return false;
}
};
map <Bitset, vector <int>, Cmp> cache[7];
bool check(Bitset bs, int turn) {
int cnt = bs.count();
assert(cnt);
if (cnt == 1) return true;
if (cnt > pow(3, turn)) return false;
if (cache[turn].count(bs)) return !cache[turn][bs].empty();
for (auto v: ask) {
vector <int> id(7);
REP(i, 3) id[v[i + 1]] = i;
vector <Bitset> nxt(3);
REP(i, 720) if (bs[i]) nxt[id[Ask(i, v)]][i] = 1;
bool ok = true;
for (Bitset &b: nxt) if (b.count() > pow(3, turn - 1)) {
ok = false;
break;
}
if (!ok) continue;
for (Bitset &b: nxt) if (b.count() && !check(b, turn - 1)) {
ok = false;
break;
}
if (ok) {
cache[turn][bs] = v;
return true;
}
}
cache[turn][bs] = vector<int>{};
return false;
}
void orderCoins() {
Bitset bs;
bs.set();
FORD(i, 7, 1) {
assert(check(bs, i));
vector <int> v = cache[i][bs];
int cur = Ask(v);
REP(i, 720) if (bs[i] && Ask(i, v) != cur) bs[i] = 0;
}
int W[6];
copy(ALL(perms[bs._Find_first()]), W);
answer(W);
}
