#include<bits/stdc++.h>
using namespace std;
int n,m,ans;
void dfs(int k,int a,int l,int x,int maxx){
    if(k==0){
        if(maxx!=x)return;
        ans++;
        return;
    }
    if((k-1)/x+k>n-a+1){
        return;
    }
    if(l+1<=x){
        dfs(k-1,a+1,l+1,x,max(maxx,l+1));
    }
    dfs(k,a+1,0,x,maxx);
     
}
int main(){
    freopen("combos.in","r",stdin);
    freopen("combos.out","w",stdout);
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        ans=0;
        dfs(m,1,0,i,-1);
        cout<<ans<<endl;
    }
    return 0;
}