#include <iostream>
#include <fstream>
#include <stack>
#include <vector>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <stack>

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

#define ll long long
#define pb push_back
const int inf = 1e9 + 5;
const int NMax = 1e5 + 5;

int N,K;
int v[NMax];

void backT(int);

int main() {
    in>>N>>K;
    backT(1);

    in.close();
    out.close();
    return 0;
}

void backT(int idx) {
    if (idx == K+1) {
        for (int i=1;i <= K;++i) {
            out<<v[i]<<' ';
        }
        out<<'\n';

        return;
    }

    for (int k=v[idx-1]+1;k <= N;++k) {
        v[idx] = k;
        backT(idx+1);
    }
}