#include<iostream>
#include<fstream>
#include<algorithm>
#include<bitset>
#include<math.h>
#include<stdio.h>
using namespace std;
FILE*so=fopen("combinari.out","w");
int main()
{
    ifstream si;
    si.open("combinari.in");

    int n,k;
    si>>n>>k;
    int maxx[k];
    int v[k],i;
    for(i=0;i<k;++i)
    {
        v[i]=i;
        maxx[i]=n-k+1+i;
    }
    while(1)
    {
        for(i=0;i<k;++i)
            fprintf(so,"%i ",v[i]+1);
        fprintf(so,"\n");
        for(i=0;i<k-1;++i)
            if(v[i+1]==maxx[i+1]-1)
                break;
        ++v[i];
        for(++i;i<k;++i)
            v[i]=v[i-1]+1;
        if(v[0]==maxx[0])
            break;
    }
}