#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
int main(){
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);
	ll N,i;cin>>N>>i;
	if(i==1){cout<<N<<endl;return 0;}
	if(i==2){
		ll m=2;
		while((m+1)*m/2<=N)m++;
		if(N!=m*(m-1)/2)cout<<m<<" "<<N-(m-1)*m/2<<endl;
		else cout<<m<<endl;
		return 0;
	}
	vector<vector<ll>>binom(2010,vector<ll>(2010));
	binom[0][0]=1;
	rep(i,0,2009)rep(j,0,i+1){
		binom[i+1][j]+=binom[i][j];
		binom[i+1][j+1]+=binom[i][j];
		binom[i+1][j]=min(N+100,binom[i+1][j]);
		binom[i+1][j+1]=min(N+100,binom[i+1][j+1]);
	}
	vector<int>ans;
	while(N){
		int m=i;
		while(binom[m][i]<=N)m++;
		m--;
		ans.emplace_back(m);
		N-=binom[m][i];
		i--;
	}
	rep(i,0,sz(ans))cout<<ans[i]<<(i==sz(ans)-1?"\n":" ");
}