#include <iostream>
#include<vector>

using namespace std;

int ossz, n, sum = 0;
vector<int> v;

void kiir()
{
    for(int i = 0; i < n; i++)
    {
        cout << v[i] << " ";
    }
    cout << endl;
}

bool vegso()
{
    return sum == ossz && v.size() == n;
}
bool resz()
{
    auto it = v.end() - 1;
    return sum <= ossz;
}

void backtracking()
{
    int k = ossz - (n * (n - 1) / 2) + 1;
    v.push_back(k);
    sum = k;
    do
    {
        auto it= v.end() - 1;
        if(*it > 1)
        {
            (*it)--;
            sum--;
            if(resz())
            {
                if(vegso())
                {
                    kiir();
                }
                else
                {
                    k--;
                    v.push_back((ossz - (k * (k - 1) / 2) + 1) - sum);
                    sum+=(ossz - (k * (k - 1) / 2) + 1 - sum;
                }
            }
        }
        else
        {
            sum -= (*it);
            v.pop_back();
        }
    }
    while(!v.empty());
}

int main()
{
    cin >> n >> ossz;
    backtracking();
    return 0;
}