#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, K;
int a[15];
bool ap[15];
void afis(int n) {
    for (int i = 1; i <= n ; ++i)
        g << a[i] << ' ';
    g << '\n';
}

void backtracking(int k, int last, int ramase) {
    if (ramase == 0) {
      afis(k - 1);
      return ;
    }

    for (int i = last + 1; i <= n ; ++i) {
        a[k] = i;
        backtracking(k + 1, i, ramase - 1);
    }
}
int main() {
    f >> n >> K;
    backtracking(1, 0, K);
    return 0;
}