#include <bits/stdc++.h>

#define VARNAME(x) #x
#define show(x) cerr << #x << " = " << x << endl

using namespace std;
using ll = long long;
using ld = long double;

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v)
{
    os << "sz:" << v.size() << "\n[";
    for (const auto& p : v) {
        os << p << ",";
    }
    os << "]\n";
    return os;
}

template <typename S, typename T>
ostream& operator<<(ostream& os, const pair<S, T>& p)
{
    os << "(" << p.first << "," << p.second
       << ")";
    return os;
}


constexpr ll MOD = (ll)1e9 + 7LL;
constexpr ld PI = static_cast<ld>(3.1415926535898);

template <typename T>
constexpr T INF = numeric_limits<T>::max() / 10;


int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    using P = pair<int, int>;
    int N, M;
    cin >> N >> M;
    vector<ll> dp(N, -1);
    dp[N - 1] = M;
    for (int i = N - 1; i > 0; i--) {
        vector<ll> tmp(N, -1);
        const int num = N - i + 1;
        const int half = num / 2 + 1;
        vector<P> v;
        for (int j = i - 1; j < N; j++) {
            v.push_back(make_pair(dp[j], -j));
        }
        sort(v.begin(), v.end());
        int sum = 0;
        for (int j = 0; j < half; j++) {
            sum += v[j].first + 1;
        }
        if (sum > M) {
            ;
        } else {
            for (int j = 0; j < half; j++) {
                tmp[-v[j].second] = dp[-v[j].second] + 1;
            }
            for (int j = half; j < num; j++) {
                tmp[-v[j].second] = 0;
            }
            tmp[i - 1] = M - sum;
            dp = tmp;
        }
    }
    for (int i = 0; i < N; i++) {
        cout << dp[i];
        if (i < N - 1) {
            cout << " ";
        }
    }
    cout << endl;

    return 0;
}