#include <fstream>

using namespace std;

int st[20], top, k, n;

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

void Write ()
{
    for (int i = 1; i <= k; i++)
        fout << st[i] << " ";
    fout << "\n";
}

void Back (int top)
{
    if (top > k)
    {
        Write();
        return;
    }
    for (int i = st[top - 1] + 1; i <= n - k + top; i++)
    {
        st[top] = i;
        Back(top + 1);
    }
}

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