#include <bits/stdc++.h>

using namespace std;

int n, k;

int ans[15];

bool vis[15];

void dfs(int x) {

if (x == k + 1) {

for (int i = 1; i <= k; i++)
		
  cout << ans[i] << " ";

cout << endl;
	
return ;

}

for (int i = 1; i <= n; i++) {

if (vis[i]) continue;
	
vis[i] = 1;
	
ans[x] = i;
	
dfs(x + 1);
	
vis[i] = 0;

}

}

int main() {

cin >> n >> k;

dfs(1);

return 0;

}