#include <iostream>
#include <cstdio>
#include <vector>
#include <stack>
#include <algorithm>
#include <fstream>
using namespace std;
#define inf 0xfffffff

int n, k, x[20];

void gen(int p) {
	for (int i = x[p]+1; i <= p + (n - k); i++) {
		x[p] = i;
		return;
	}
	gen(p-1);
	x[p] = x[p-1] + 1;
}

int main() {
	
	freopen("combinari.in","r",stdin);
	freopen("combinari.out","w",stdout);
	
	scanf("%d %d", &n, &k);
	
	for (int i = 1; i <= k; i++) {
		x[i] = i;
	}
	
	do {
		for (int i = 1; i <= k; i++) printf("%d ", x[i]);
		printf("\n");
		gen(k);
	} while (x[0] == 0);
		
	return 0;
}