#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

using namespace std;

ll t,n,k,s[20];
void back(int u) {
	if (u==k+1) {
		for (int i=1; i<=k; i++) {
			cout << s[i] << " ";
		}
		cout << '\n';
	}
	else {
		for (int i=s[u-1]+1; i<=n; i++) {
			s[u]=i;
			back(u+1);
		}
	}
}
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	//ifstream cin("combinari.in");
	//ofstream cout("combinari.out");
	cin >> n >> k;
	back(1);
}