POJ1833 排列

//#include <bits/stdc++.h>
//define _ ios_base::sync_with_stdio(0);cin.tie(0);

#include <iostream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <bitset>
#include <string>
#include <numeric>
#include <algorithm>
#include <functional>
#include <iterator>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <complex>
#include <ctime>

#define INF 0x3f3f3f3f
#define eps 1e-6

typedef long long LL;
const double pi = acos(-1.0);
const double delta = 1e-9;
const long long mod = 1e9 + 7;
using namespace std;

int a[1050];

int main()
{
    //freopen("int.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int T;
    scanf("%d",&T);
    int n,k;
    while(T--)
    {
        scanf("%d %d",&n,&k);
        for(int i = 0;i < n;i++)
            scanf("%d",&a[i]);
        for(int i = 0;i < k;i++)
        {
            if(!next_permutation(a,a + n))
                for(int i = 0;i < n;i++)
                    a[i] = i + 1;
        }
        for(int i = 0;i < n - 1;i++)
            printf("%d ",a[i]);
        printf("%d\n",a[n - 1]);
    }
    return 0;
}