Yet Another Permutation Problem 2

You are given a permutation $P=(P_1,P_2,\cdots,P_N)$ of the integers from $1$ to $N$.

Construct a permutation $Q=(Q_1,Q_2,\cdots,Q_N)$.

The sequence $P_1+Q_1,P_2+Q_2,\cdots,P_N+Q_N$ must be . In other words, must hold for every ().

It is guaranteed that such a permutation $Q$ always exists.

The input is given in the following format:

$T$ $\mathrm{case}_1$ $\mathrm{case}_2$

For each test case, print the elements $Q_1,Q_2,\cdots,Q_N$ of any valid permutation on one line, separated by spaces.

• $1 \leq T \leq 100\,000$.
• $1 \leq N \leq 200\,000$.
• $1\le {}_{}$ ().