poj1833

#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#define INF 0x7fffffff
#define mst(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn=1e5+5;
int arr[1025],tmp[1025];
void (int* arr,int num)
{
    int pr=0;
    for(int i=0;i<num;i++){
        if(pr==0){
            pr++; 
            printf("%d",arr[i]);
        }else{
            printf(" %d",arr[i]);
        }
    }
    printf("n");
}
int main()
{
    int t;
    cin>>t;
    while(t--)
    {    
        mst(arr,0);mst(tmp,0);
        int n,k;
        cin>>n>>k;
        for(int i=0;i<n;i++)
            scanf("%d",&arr[i]);
        bool flag;
        while(k)
        {
            flag=next_permutation(arr,arr+n);
            if(flag=0)        
            {
                sort(arr,arr+n);
                next_permutation(arr,arr+n);
            }

            k-=1;
        }
        output(arr,n);
    }
    return 0;
}