#include <bits/stdc++.h>

using namespace std;

ofstream fout("combinari.out");
ifstream fin("combinari.in");
short n,k,st[20];

void citire()
{
    fin >> n >> k;
}

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

bool Valid(int x, int top)
{
    for(int i = 1; i < top; i++)
        if(st[i] == x)
            return 0;
    return 1;
}

void Back(int top)
{
    if(top == k+1) afisare(k);
    else
    {
        for(int i = st[top-1]+1; i <= n; i++)
        /// cautarea candidatului
            if(Valid(i,top))
            {
                st[top] = i;
                Back(top+1);
            }
    }
}

int main()
{
    citire();
    Back(1);
    fin.close();
    fout.close();
    return 0;
}