#include <iostream>
#include <fstream>
using namespace std;
int n,k,i,pos,v[20];
int main(void)
{
    FILE * f;
    f=fopen("combinari.in","r");
    ofstream g("combinari.out");
    fscanf(f,"%d%d",&n,&k);
    for (i=1;i<=k;i++)
        v[i]=i;
    do
    {
        for (i=1;i<=k;i++)
            g<<v[i]<<' ';
        g<<'\n';
        v[k]++;
        if (v[k]>n)
        {
            pos=k;
            v[k]--;
            while ((v[pos-1]+1)==v[pos])
                pos--;
            v[pos-1]++;
            for (i=pos;i<=k;i++)
                v[i]=v[i-1]+1;
        }
    }
    while (v[1]!=n-k+1);
    g.close();
    return 0;
}