#include <bits/stdc++.h>
#define ff first
#define ss second

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;

const string file = "farfurii";
const ll INF = 9223372036854775807ll;
const int inf = 2147483647, nmax = 100005;

int n, aint[nmax*4], aib[nmax];
ll m;

void update(int nod, int st, int dr, int pos, int val)
{
    if(st == dr){
        aint[nod] += val;
    }else{
        int mid = (st+dr)/2;
        if(mid >= pos)
            update(nod*2, st, mid, pos, val);
        else update(nod*2+1, mid+1, dr, pos, val);
        aint[nod] = aint[nod*2]+aint[nod*2+1];
    }
}

int query(int nod, int st, int dr, int l, int r)
{
    if(st >= l && dr <= r)
        return aint[nod];
    int mid = (st+dr)/2, ans = 0;
    if(mid >= l)
        ans = query(nod*2, st, mid, l, r);
    if(mid+1 <= r)
        ans += query(nod*2+1, mid+1, dr, l, r);
    return ans;
}

void updaib(int pos, int val)
{
    while(pos <= n){
        aib[pos] += val;
        pos += (pos&(-pos));
    }
}

int read(int pos)
{
    int sum = 0;
    while(pos){
        sum += aib[pos];
        pos -= (pos&(-pos));
    }
    return sum;
}

class InParser {
private:
    FILE *fin;
    char *buff;
    int sp;

    char read_ch() {
        ++sp;
        if (sp == 4096) {
            sp = 0;
            fread(buff, 1, 4096, fin);
        }
        return buff[sp];
    }

public:
    InParser(const char* nume) {
        fin = fopen(nume, "r");
        buff = new char[4096]();
        sp = 4095;
    }

    InParser& operator >> (int &n) {
        char c;
        while (!isdigit(c = read_ch()) && c != '-');
        int sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }

    InParser& operator >> (long long &n) {
        char c;
        n = 0;
        while (!isdigit(c = read_ch()) && c != '-');
        long long sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }
};

class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }


public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }

    OutParser& operator << (int vu32) {
        if(vu32 == -1){
            write_ch('-');
            write_ch('1');
        } else if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (long long vu64) {
        if (vu64 <= 9) {
            write_ch(vu64 + '0');
        } else {
            (*this) << (vu64 / 10);
            write_ch(vu64 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};


int main()
{
    InParser fin ("farfurii.in");
    OutParser fout ("farfurii.out");
    fin >> n >> m;
    for (int i = 1; i <= n; ++i){
        ll now = m-1ll*(n-i)*(n-i-1)/2+1;
        now = max(now, 1ll);
        m -= now-1;
        int st = 1, dr = n, mid, ans=-1;
        for (mid = (st+dr)/2; st <= dr; mid = (st+dr)/2)
            if(mid-read(mid) >= now){
                ans = mid;
                dr = mid-1;
            }else st = mid+1;
        updaib(ans, 1);
        fout << ans << " ";
    }
    return 0;
}