#include<stdio.h>
#include<assert.h>

#include<algorithm>
#include<vector>

using namespace std;

const int knmax = 20;
int elements, card, perm[knmax];

void print_stuff(){
  for(int i = 1; i <= card; ++i)
    printf("%d ", perm[i]);

  printf("\n");

}

void back(int k){
  if(k == card + 1){
    print_stuff();

    return;
  }

  int i;
  for(i = perm[k - 1] + 1; i <= elements; ++i){
    perm[k] = i;

    back(k + 1);

  }

}

int main(){
  assert(freopen("combinari.in", "r", stdin) != NULL);
  assert(freopen("combinari.out", "w", stdout) != NULL);

  scanf("%d%d", &elements, &card);

  back(1);

  return 0;
}