#include <bits/stdc++.h>
using namespace std;
const int N = 25;
int n, k;
int path[N];
void dfs(int u, int start) {
if (u == k) {
for (int i = 0; i < k; i ++ )
printf("%3d", path[i]);
cout << endl;
return;
}
for (int i = start; i <= n; i ++ ) {
path[u] = i;
dfs(u + 1, i + 1);
path[u] = 0;
}
}
int main() {
cin >> n >> k;
dfs(0, 1);
return 0;
}