#include <bits/stdc++.h>

using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");

const int NMax = 21;

int n,k,e;
int st[NMax],a[NMax],fol[NMax];

void back(int k){
    for(int i = st[k - 1] + 1; i <= n; ++i){
        if(!fol[i]){
            fol[i] = 1;
            st[k] = i;

            if(k == e){
                for(int j = 1; j <= e; ++j){
                    g << st[j] << ' ';
                }
                g << '\n';
            }else
                back(k + 1);

            fol[i] = 0;
        }
    }
}
int main()
{
    f >> n >> e;
    back(1);
    return 0;
}