#include <iostream>
#include <vector>
using namespace std;

int h, e;
vector<int> a;

void backtrack(int poz, int utolso, int marad) {
    if (poz == h - 1) {
        if (marad >= 1 && marad < utolso) {
            a[poz] = marad;
            for (int i = 0; i < h; i++) {
                cout << a[i];
                if (i + 1 < h) cout << ' ';
                else cout << '\n';
            }
        }
        return;
    }

    int marpoz = h - poz - 1;
    int minsum = marpoz * (marpoz + 1) / 2;
    int aktmax = min(utolso - 1, marad - minsum);

    for (int i = aktmax; i >= 1; i--) {
        int ujmarad = marad - i;
        if (ujmarad < minsum) continue;

        a[poz] = i;
        backtrack(poz + 1, i, ujmarad);
    }
}

int main()
{
    cin >> h >> e;
    
    int totmin = h * (h + 1) / 2;
    if (e < totmin) return 0;

    a.resize(h);
    backtrack(0, e + 1, e);
    

}