// Made by Alex Prohnitchi

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

typedef long long ll;

const ll mod=1e9+7;

const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};

#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define rc(x)  return cout<<x<<"\n",0
#define sz(s)  (int) s.size()
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define PI 3.14159265358979

using namespace std;



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

int n,k,a[20];

void printare() {
	for (int i=1; i<=k; i++) {
		g << a[i] << " ";
	}
	g << "\n";
}

int backtracking(int x) {
		for (int i=a[x-1]+1; i<=n; i++) {
			a[x]=i;
			if (x==k) printare();
			else backtracking(x+1);
		}
}

int main() {
	f >> n >> k;
	backtracking(1);

}