#include <bits/stdc++.h>

using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n , k , st[20] , viz[20];
void Afis(int top)
{
    int i;
    for(i = 1; i <= top; i++)
        fout << st[i] << " ";
    fout << "\n";
}
void Back(int top)
{
    if(top == k + 1)Afis(k);
    else for(int i = st[top - 1] + 1; i <= n - k + top; i++)
        if(viz[i] == 0)
        {
            st[top] = i;
            viz[i] = 1;
            Back(top + 1);
            viz[i] = 0;
        }
}
int main()
{
    fin >> n >> k;
    Back(1);
    return 0;
}