#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

int n,m;

int ans[1252];
int tmp[1252];

int main(){
  cin>>n>>m;
  REP(i,n)ans[i] = -1;
  ans[n-1] = m;
  FORR(i,0,n-1){
    int rest = m;
    priority_queue<pii> Q;
    FOR(j,i+1,n)Q.push(pii(-ans[j], j));
    REP(j,n)tmp[j] = -1;
    int vote = 1;
    while(Q.size()>0 && rest>0){
      pii P = Q.top(); Q.pop();
      int id = P.second;
      if(rest < ans[id]+1)break;
      tmp[id] = ans[id]+1;
      rest -= ans[id]+1;
      vote++;
    }
    tmp[i] = rest;
    FOR(j,i+1,n)CHMAX(tmp[j],0);
    int peop = n-i;
    if(vote > peop/2){
      // saiyou
      REP(j,n)ans[j] = tmp[j];
    }
  }
  REP(i,n)printf("%d%c",ans[i],i==n-1?'\n':' ');
  return 0;
}