时间限制：C/C++/Rust/Pascal 2秒，其他语言4秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
题目描述
The pseudocode of function f is as follows:
Now you are given n, m, k and the return array ret[0 .. n-1] of this function.
Please find the array b[0 .. n-1] which is the k-th lexicographically smallest array of length n that satisfies f(n, b, m) = ret[0 .. n-1].
The input will be given such that there are at least k different arrays of length n that function f returns ret[0 .. n-1] when being the input array.
function f(int n, array a[], int m):
for i from m - 1 to n - 1:
sort elements in a[i-m+1 .. i] in non-decreasing order
return array a[0 .. n-1] Now you are given n, m, k and the return array ret[0 .. n-1] of this function.
Please find the array b[0 .. n-1] which is the k-th lexicographically smallest array of length n that satisfies f(n, b, m) = ret[0 .. n-1].
The input will be given such that there are at least k different arrays of length n that function f returns ret[0 .. n-1] when being the input array.
输入描述:
The first line contains one integer t () --- the number of test cases.
Each test contains two lines. The first line contains three integers n, m, k (,
,
). The second line contains n integers ret[0], ret[1], ..., ret[n-1]. (ret[0 .. n-1] is a permutation of
)
The sum of n across the test cases doesn't exceed.
输出描述:
For each test, output one line contains n integers, representing b[0 .. n-1].