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

int n, prize;
vector<int> a;

void print_a() {
    for (int i=0; i < a.size(); i++) {
        cout << a[i] << ' ';
    }
    cout << '\n';
}

void backtrack(int prev, int l, int rem) {
    if (l == n - 1) {
        if (rem >= 1 && rem < prev) {
            a[l] = rem;
            print_a();
        }
        return;
    }

    int k = n - l - 1;
    int low = k *(k + 1) / 2;
    int high = min(prev - 1, rem - low);

    for (int i=high; i >= 1; i--) {
        a[l] = i;
        backtrack(i, l + 1, rem - i);
    }
}

int main()
{
    cin >> n >> prize;
    a.assign(n, 0);
    backtrack(prize + 1, 0, prize);
    return 0;
}