#include <bits/stdc++.h>

#define Nmax 25

using namespace std;

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

int N, K;

int Array[Nmax];

void back(int node)
{
    for(int i = Array[node - 1] + 1; i <= N; ++i)
    {
        Array[node] = i;
        if(node != K)
            back(1 + node);
        else
        {
            for(int i = 1; i <= K; ++i)
                fout << Array[i] << " ";
            fout << "\n";
        }
    }
}

int main()
{
    fin >> N >> K;
    back(1);
    return 0;
}