// Template v2
#define pb push_back
#define mp make_pair
#define first x
#define second y
#define l(x) x<<1
#define r(x) x<<1 | 1
#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef long double LD;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<double, double> PKK;
// primes less than 100
const int PRIM[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97};
const int CMAX = 350;
const int MOD = 1000000007;
const int NMAX = 500005;
const short INF16 = 32000;
const int INF = int(1e9);
const LL INF64 = LL(1e18);
const LD EPS = 1e-9, PI = acos(-1.0);

LL n,k;

void read()
{
	cin>>n>>k;
}

void solve()
{
	LL l;
	for(l=0; (l+1)*(l+2)/2 <=k; ++l);
	LL d2=k-l*(l+1)/2;
	for(LL i=1; i<=n-l-2; ++i)
		cout<<i<<" ";
	cout<<n-d2<<" ";
	for(LL i=n; i>=n-l; --i)
	{
		cout<<(i-((n-i>=d2)?1:0))<<" ";
	}
}


int main() {
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    cout << setprecision(16) << fixed;

    assert(freopen("farfurii.in", "rt", stdin));
    assert(freopen("farfurii.out", "wt", stdout));

    read();
    solve();

    return 0;
}