from operator import itemgetter
from itertools import *
from bisect import *
from collections import *
from heapq import *
import sys

sys.setrecursionlimit(10 ** 6)

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]


def main():
    n,m=MI()
    if n==1:print(m)
    if n==2:print(-1,m)
    if n==3:print(m,0,0)
    if n<4:exit()
    ans=[0]*n
    ans[-3]=m
    for i in range(n-4,-1,-1):
        #print(i,ans)
        hp=[]
        p=m
        for j in range(i+1,n):heappush(hp,(ans[j],j))
        nans = [0] * n
        for _ in range((n-i)//2):
            a,j=heappop(hp)
            nans[j]=a+1
            p-=a+1
        if p<0:
            for j in range(i+1):
                ans[j]=-1
            break
        nans[i]=p
        ans=nans

    print(*ans)

main()