#include<iostream>
#include<fstream>
#include<cstdio>
#include<ctime>
#include<cmath>
#include<algorithm>
using namespace std;

ifstream fin("combinari.in");
ofstream fout("combinari.out");

int n,k,st[20];

inline void BACK(int x)
{
    if (x==k+1)
        {
            for (int i=1;i<=k;i++)
                fout<<st[i]<<" ";
            fout<<"\n";
        }
    else for (int i=st[x-1]+1;i<=n-(k-x);i++)
            {
                st[x]=i;
                BACK(x+1);
            }
}

int main()
{
    fin>>n>>k;
    BACK(1);
    return 0;
}