tower

This problem is an interactive problem.

You are to implement the following procedure: std::vector<int> order_of_doors(int n, int k);

You may use the following function to make a query:
std::vector<std::pair<int,int>> query_shortest_pairs(int x, int y, int z);

Input is given in the following form to the sample grader:
t k
[testcase 1]
[testcase 2]
...
[testcase t]

Each testcase is given in the following form:
N
x0 x1 x2 ... x(N-1)

If your answer is correct, the sample grader will output:
Correct!
[total number of queries] queries used in [t] testcases.

Otherwise, it will output:
WA, [reason your answer is incorrect].
Time Limit: 1 Seconds
Memory Limit: 256MB
Your best score: 0
Source: BOI 2025 (Day 1)

Subtask Score
1 6
2 7
3 9
4 22
5 56
6 0