> #include <cstdio>
> #include <iostream>
> #include <algorithm>
> using namespace std;
> 
> int main(){
>     int n, k, m, a[2000];
>     scanf("%d",&m);
>     while (m--){
>         scanf("%d%d",&n,&k);
> 
>         for (int i=0;i<n;++i)
>             scanf("%d",a+i);
>         while (k--) next_permutation(a,a+n);
>         for (int i=0;i<n;++i)
>             printf("%d%c",a[i],i==n-1?'\n':' ');
>     }
>     return 0;
> }
> 
> printf("%d%c",a[i],i==n-1?'\n':' ');
> 跟
> cout << a[i] << (i==n-1?'\n':' ');