#include <cstdio>
#include <deque>
#include <algorithm>
#include <iterator>
#include <stdio.h>  
#include <stdlib.h>
#include <iostream>
#include <string.h>
#include <assert.h>

using namespace std;
deque<int> result;

void solve(int n, int k) {
	if (result.size() < k) {
		for (int m = n; m >= 1; --m) {
			result.push_back(m);
			solve(m - 1, k);
			result.pop_back();
		}
	}
	else {
		copy(result.begin(), result.end(), ostream_iterator<int>(cout));
		cout << endl;
	}
}

int main(int argc, char *argv[]) {
	int n, k;
	scanf("%d%d", &n, &k);
	solve(n, k);
	return 0;
}