#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 30;
int n, m;
int st[N];
void dfs(int u, int start)
{
if (u > m)
{
for (int i = 1; i <= m; i++)
printf("%d ", st[i]);
printf("\n");
return;
}
for (int i = start; i <= n; i++)
{
st[u] = i;
dfs(u + 1, i + 1);
}
}
int main()
{
scanf("%d%d", &n, &m);
dfs(1, 1);
return 0;
}、