1
#include <cstdio>
2
#include <cstring>
3
#include <algorithm>
4
using namespace std;
5
#define LL long long
6
LL Sum[1000005];
7
LL x;
8
int ans[1000005];
9
int main()
10
{
11
    int n;
12
    scanf("%d%lld", &n, &x);
13
    for (int i = n - 2; i >= 0; i--)
14
        Sum[i] = Sum[i + 1] + i;
15
    if (Sum[0] < x)
16
    {
17
        puts("-1");
18
        return 0;
19
    }
20
    int k, i, j;
21
    for (k = 1; k <= n - 2; k++)
22
        if (x > Sum[k])
23
            break;
24
    x = x - Sum[k];
25
    for (i = n - k, j = 1; i <= n - 1; i++, j++)
26
        ans[j] = i;
27
    for (i = 1; i <= n - k - 1; i++, j++)
28
        ans[j] = i;
29
    ans[n] = n;
30
    i = 1;
31
    while (x--)
32
    {
33
        swap(ans[i], ans[i + 1]);
34
        i++;
35
    }
36
    for (i = 1; i < n; i++)
37
        printf("%d ", ans[i]);
38
    printf("%d\n", ans[n]);
39
}