#include <cstdio>
const int NMAX = 20;
int n, k, A[NMAX];

void back(int t, int lastTaken, int sol[]) {
  if (t == k + 1) {
    for (int i = 1; i < k; i++)
      printf("%d ", sol[i]);
    printf("%d\n", sol[k]);
    return ;
  }
  for (int i = lastTaken + 1; i <= n; i++) {
    sol[t] = i;
    back(t + 1, i, sol);
  }
}

int main() {
  freopen("combinari.in", "r", stdin);
  freopen("combinari.out", "w", stdout);
  
  scanf("%d%d", &n, &k);
  back(1, 0, A);
  return 0;
}