#include <iostream>
#include <cstdio>
using namespace std;
int n,m,k,sol[20];

void backt(int k)
{
    if (k>m)
    {
        for (int i=1; i<=m; ++i)
            printf("%d ",sol[i]);
        printf("\n");
        return;
    }
    for (sol[k]=sol[k-1]+1; sol[k]<=n-m+k; sol[k]++)
        backt(k+1);
}

int main()
{
    freopen("combinari.in","r",stdin);
    freopen("combinari.out","w",stdout);
    scanf("%d%d",&n,&m);
    backt(1);
    return 0;
}