#include<iostream>
using namespace std;
int n, m;
const int N = 20;
int res[N];
bool jud[N];
void dfs(int u) {
if (u == m){
for (int i = 0; i < m; i ++ ){
cout << res[i] << ' ';
}
cout << endl;
return ;
}
else{
for (int i = 1; i <= n; i ++ ){
if (!jud[i] && i > res[u - 1]){
jud[i] = true;
res[u] = i;
dfs(u + 1);
jud[i] = false;
}
}
}
}
int main (){
cin >> n >> m;
dfs(0);
return 0;
}