#include <iostream>
#include <algorithm>
#include <vector>

void solve() {
    int n, m;
    std::cin >> n >> m;

    std::vector<int> assign{m};
    for (int k = 2; k <= n; ++k) {
        assign.push_back(-1);

        std::vector<std::pair<int, int>> reqs(k);
        for (int i = 0; i < k; ++i) {
            reqs[i] = std::make_pair(assign[i] + 1, i);
        }
        std::sort(reqs.begin(), reqs.end());

        std::vector<int> nassign(k, 0);
        int need = 0, got = 0;
        for (auto [req, i] : reqs) {
            need += req;
            nassign[i] = req;

            ++got;
            if (got > k - got) break;
        }

        if (need > m) continue;

        nassign[k - 1] = m - need;
        assign = nassign;
    }

    std::reverse(assign.begin(), assign.end());
    for (auto x : assign) std::cout << x << " ";
    std::cout << "\n";
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}