#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <queue>
#include <random>
#include "scales.h"
using namespace std;
#define all(a) (a).begin(), (a).end()
#define ll long long
#define ld long double
#define ui uint64_t
#define cont(set, element) ((set).find(element) != (set).end())
#define pb push_back
#define chmin(x, y) (x = min(x, y))
#define chmax(x, y) (x = max(x, y))
/********* DEBUG *********/
template <typename T>
void outvec(const vector<T>& Z){
for (const T& x : Z)
cout << x << ' ';
cout << "\n";
}
void printVariable(const any& var) {
if (!var.has_value()) {
cout << "null";
return;
}
if (var.type() == typeid(int)) {
cout << any_cast<int>(var);
} else if (var.type() == typeid(double)) {
cout << any_cast<double>(var);
} else if (var.type() == typeid(float)) {
cout << any_cast<float>(var);
} else if (var.type() == typeid(char)) {
cout << any_cast<char>(var);
} else if (var.type() == typeid(bool)) {
cout << (any_cast<bool>(var) ? "true" : "false");
} else if (var.type() == typeid(string)) {
cout << any_cast<string>(var);
} else if (var.type() == typeid(const char*)) {
cout << any_cast<const char*>(var);
} else if (var.type() == typeid(long long)) {
cout << any_cast<long long>(var);
} else {
cout << "[unknown type]";
}
}
template<typename... Args>
void outval(Args... args) {
vector<any> variables = {args...};
for (size_t i = 0; i < variables.size(); ++i) {
printVariable(variables[i]);
if (i != variables.size() - 1) {
cout << " ";
}
}
cout << "\n";
}
#define sp << " " <<
#define fi first
#define se second
/********* DEBUG *********/
const ll MOD2 = 1e9 + 7;
const ll MOD = 998244353;
const ll inf = 1e18;
void init(int T){
}
void orderCoins() {
vector<int> orderA(3), orderB(3);
orderA[0] = getLightest(1,2,3);
orderA[1] = getMedian(1,2,3);
orderA[2] = 1;
while (orderA[0] == orderA[2] || orderA[1] == orderA[2])
orderA[2]++;
orderB[0] = getLightest(4,5,6);
orderB[1] = getMedian(4,5,6);
orderB[2] = 4;
while (orderB[0] == orderB[2] || orderB[1] == orderB[2])
orderB[2]++;
int ans[6];
ans[0] = getLightest(orderA[0], orderB[0], orderA[1]);
int a = 2, b = 2, i = 5;
for (; i > 1 && a>=0 && b>=0; i--){
if (orderA[a] == getHeaviest(orderA[a], orderB[b], ans[0]))
ans[i] = orderA[a--];
else
ans[i] = orderB[b--];
}
while (a >= 0)
ans[i--] = orderA[a--];
while (b >= 0)
ans[i--] = orderB[b--];
answer(ans);
}
