Find Permutation

Given b₀, b₁, ..., b_n-1, find two permutations {a_i}, {c_i} of 0..n-1 such that a_i+b_i=c_i (mod n) for every i.

First line, number of test cases, T.
Following are 2*T. For every two lines, the first line is n and the second line contains n integers.

Sum of all n <= 10⁵.
0<=b_i<n
It's guaranteed that there exists a solution.
Test data is generated by randomly choosing two permutations and subtracting one from the other.

2*T lines. Every line contains n integers. For every two lines, the first line represents {a_i} and the second line represents {c_i}.
If there are multiple solutions, output any one of them.

1
3
0 1 2

2 0 1
2 1 0

2013 Multi-University Training Contest 6