#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using mint = atcoder::static_modint<998244353>;
// // using mint = atcoder::static_modint<1000000007>;
using ld = long double;
using ll = long long;
#define mp(a,b) make_pair(a,b)
#define rep(i,s,n) for(int i=s; i<(int)n; i++)
const vector<int> dx{1,0,-1,0},dy{0,1,0,-1};

pair<ll,ll> solve(ll n,int i){
    if(i==1)return {n,n};
    ll k=i,x=1;
    while((k+1)*x/(k+1-i)<=n){
        k++;
        x*=k;
        x/=k-i;
    }
    return {k,x};
}
int main(){
    ll n,i;cin >> n >> i;
    while(n>0){
        auto [k,x]=solve(n,i);
        cout << k << " ";
        n-=x;
        i--;
    }
}