#include <fstream>
using namespace std;

unsigned short c[19], N, K;

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

void solve(unsigned short poz = 1){
    c[poz] = c[poz - 1] + 1;
    while(c[poz] <= N - K + poz)
    {
        if(poz == K)
        {
            for(unsigned short i = 1; i <= K; i++) fout << c[i] << ' ';
            fout << '\n';
        }
        else solve(poz + 1);

        ++c[poz];
    }
}

int main()
{
    fin >> N >> K;
    solve();
}