#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

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

vector<int> a(20, 0);
int N;
int K;

void print() {
  for (int i = 1; i <= K; ++i) {
    out << a[i] << (i == K ? "" : " ");
  }
  out << endl;
}

void comb(int ind, int start) {

  if (ind == K + 1) {
    print();
    return;
  }

  for (int i = start; i <= N - K + ind; ++i) {
    a[ind] = i;
    comb(ind + 1, i + 1);
  }
}

void solve() {
  in >> N >> K;
  comb(1, 1);
};

int main() {
  solve();
  return 0;
}