#include<cstdio> #include<algorithm> usingnamespacestd;
constint maxn = 10000+5;
int num[maxn];
int main()
{
int n,m;
while( scanf("%d%d",&n,&m) == 2)
{
for( int i = 0; i < n; i++)
scanf("%d",&num[i]);
for( int i = 0; i < m; i++)
next_permutation(num,num+n); //求全排列for( int i = 0; i < n; i++)
printf(i==n-1?"%d\n":"%d ",num[i]);
}
return0;
}