#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<cstring>
#include<deque>
#define itn int
#define maxn 
#define xlm mylove
using namespace std;
int a[10010],n,m;
inline void in(){
	freopen("martian.in","r",stdin);
	freopen("martian.out","w",stdout);
	scanf("%d%d",&n,&m);
	for (int i=1;i<=n;i++){
		scanf("%d",&a[i]);
	}
}
inline void work(){
	for (int i=1;i<=m;i++){
		next_permutation(a+1,a+n+1);
	}
}
inline void print(){
	for (int i=1;i<=n;i++){
		printf("%d ",a[i]);
	}
}
int Main(){
	in();
	work();
	print();
	return 0;
}
int main(){;}
int xlm=Main();