#include <fstream>
using namespace std;

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

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

void bt(int niv) {
    for (int i = st[niv - 1] + 1 ; i <= n ; i++) {
        if (f[i] == 0) {
            f[i] = 1;
            st[niv] = i;

            if (niv == k) {
                for (int j = 1 ; j <= k ; j++)
                    fout<<st[j]<<' ';
                fout<<'\n';
            } else {
                bt(niv + 1);
            }

            f[i] = 0;
        }
    }
}

int main() {
    fin>>n>>k;
    bt(1);
}



/*

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int i, n;
vector<int> myVec;

int main()
{
    cin>>n;
    for (i = 1 ; i <= n ; i++)
        myVec.push_back(i);

    do {
        for (auto it = myVec.begin() ; it != myVec.end() ; it++)
            cout<<*it<<' ';
        cout<<'\n';
    } while (next_permutation(myVec.begin(), myVec.end()));

    return 0;
}

*/