#include <bits/stdc++.h>

using namespace std;

int n;
long long x = -1, y = -1, z = -1;
long long k;

inline long long mySqrt(long long res) {
    long long ret = floor(sqrtl(res));
    for (long long i = ret - 3; i <= ret + 3; ++i)
        if (i >= 0 && i * i == res) return i;
    return -1;
}

inline bool check(long long nx) {
    long long c = n + 1 - nx;
    long long res = 4ll * c * c - 8ll * (c * (c - 1) + nx * (nx - 1) - k * 2);
    if (res < 0) return false;
    res = mySqrt(res);
    if (res < 0) return false;
    if ((c * 2 + res) % 4 != 0) return false;
    long long ny1 = (c * 2 + res) / 4, ny2 = (c * 2 - res) / 4;
    if (ny1 >= 0 && nx + ny1 <= n + 1) {
        x = nx, y = ny1, z = n + 1 - x - y;
        return true;
    }
    if (ny2 >= 0 && nx + ny2 <= n + 1) {
        x = nx, y = ny2, z = n + 1 - x - y;
        return true;
    }
    return false;
}

int main(){
    scanf("%d%lld", &n, &k);
    for (int i = n + 1; i >= 1; --i) {
        if (check(i)) {
            break;
        }
    }

    if (x == -1) {
        puts("-1");
        return 0;
    }

    vector<int> ans;
    for (int i = 0; i < x - 1; ++i) ans.push_back(0);
    if (y) {
        ans.push_back(1);
        for (int i = 0; i < y - 1; ++i) ans.push_back(0);
        if (z) {
            ans.push_back(1);
            for (int i = 0; i < z - 1; ++i) ans.push_back(0);
        }
    }
    else {
        if (z) {
            ans.push_back(2);
            for (int i = 0; i < z - 1; ++i) ans.push_back(0);
        }
    }

    for (auto a: ans) printf("%d ", a); puts("");
    return 0;
}