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