#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pll = pair<ll,ll>;
using vll = vector<ll>;
using vi = vector<int>;
using pi = pair<int, int>;
using vpi = vector<pair<int, int>>;
using vai = vector<array<int, 3>>;

#define x first
#define y second
#define all(x) x.begin(), x.end()

int n;
void dfs(vi &ans, int rem) {
    if (ans.size() == n) {
        if (rem == 0) {
            for (int &i : ans) cout << i << " ";
            cout << "\n";
        }
    } if (rem == 0) return;
    int pos = n-ans.size();
    for (int i = min(rem-(pos*(pos-1))/2, ans[ans.size()-1]-1); i >= 1; i--) {
        ans.push_back(i);
        dfs(ans, rem-i);
        ans.pop_back();
    }
}

void solve() {
    int k; cin >> n >> k;
    vi ans;
    for (int i = k-(n*(n-1))/2; i >= 1; i--) {
        ans.push_back(i);
        dfs(ans, k-i);
        ans.pop_back();
    }
}

int main() {
	ios::sync_with_stdio(0);
    cin.tie(0);

    int t=1;
    //cin >> t;
    while (t--) {
        solve();
    }
}