#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair<ll, ll>
#define sz(x) (int)((x).size())
#define all(a) (a).begin(), (a).end()

/*const ll maxn = 1e5;
int f[maxn],nf[maxn],inv[maxn];
const int M=998244353;
void init(){
    inv[1]=1; for (int i=2;i<maxn;i++) inv[i]=M-1ll*(M/i)*inv[M%i]%M;
    f[0]=nf[0]=1; for (int i=1;i<maxn;i++) f[i]=1ll*f[i-1]*i%M,nf[i]=1ll*nf[i-1]*inv[i]%M;
}
int C(int x,int y){return 1ll*f[x]*nf[y]%M*nf[x-y]%M;} */

const ll mod = 1e9+7;
ll n, k, m, mi, ma;
vector<ll> a(20);

ifstream fin("combinari.in");
ofstream fout("combinari.out");

void comb(ll i, ll cur){
	
	if(cur == k){
		for(int i = 0; i<k; i++) fout << a[i] << " "; fout << "\n";
		return;
	}
	if(n - i < k - cur)	return;
	a[cur] = i + 1;
	comb(i + 1, cur + 1);
	comb(i + 1, cur);
	
}


void solve(){
	
	fin >> n >> k;
	comb(0, 0);

}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);

	//init();
	
	int t=1;
//	cin >> t;
	while(t--) solve();
	
	return 0;
}