#include <iostream>
#include <fstream>

using namespace std;
const int Nmax = 20;

int K, N;
int path[Nmax];

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

void print()
{
    for (int i = 0; i < K; i++)
        g << path[i] << ' ';
    g << '\n';
}

void dfs(int pos, int n)
{
    if (pos == K) { print(); return; }
    if (N-n+1 < K-pos) return;
    for (int i = n; i <= N; i++) {
        path[pos] = i;
        dfs(pos+1, i+1);
    }
}

int main()
{
    f >> N >> K;
    dfs(0, 1);

    return 0;
}