#include <iostream>
#include <fstream>
using namespace std;

ifstream f ("combinari.in");
ofstream g ("combinari.out");

const int NMAX = 18;
int N, K;
int x[NMAX+1];

void afis() {
    for (int i=1; i<=K; i++)
        g << x[i] << ' ';
    g << '\n';
}

void backTracking(int k) {
    if (k <= K)
        for (x[k] = x[k-1]+1; x[k] <= N; x[k]++)
            backTracking(k+1);
    else
        afis();
}

int main()
{
    f >> N >> K;
    backTracking(1);
    return 0;
}