#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e17;
const ll dy[9]={0,1,-1,0,1,1,-1,-1,0};
const ll dx[9]={1,0,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int main(){
    ll n,m;cin >> n >> m;
    vl dp={m};
    for(int i=2;i<=n;i++){
        dp.emplace_back(-1);
        vpl ord;
        rep(j,dp.size())ord.emplace_back(dp[j]+1,j);
        sort(all(ord));
        ll need=0;
        rep(j,(i+2)/2){
            need+=ord[j].first;
        }
        if(need<=m){
            rep(j,i){
                if(j<(i+2)/2)dp[ord[j].second]++;
                else dp[ord[j].second]=0;
            }

            dp[i-1]=m-need;
        }
        //for(auto p:dp)cout << p <<" ";cout << endl;
    }
    rev(all(dp));
    rep(i,n)cout << dp[i] <<" ";cout << endl;
}