def main(n, m):
    gain = [[0] * n for i in range(n)]
    for i in range(n):
        for j in range(i):
            gain[i][j] = -1
    gain[n - 1][n - 1] = m

    for i in range(n - 2, -1, -1):
        santa = []
        for j in range(i + 1, n):
            santa.append((gain[i + 1][j], -j))
        santa.sort(reverse=True)
        majority = (n - i) // 2 + 1
        rest = m
        vote = 1
        for j in range(majority - 1):
            g, si = santa.pop()
            si = -si
            if rest >= g+1:
                vote += 1
                gain[i][si] = g+1
            rest -= gain[i][si]
        if vote*2 > n-i:
            gain[i][i] = rest
        else:
            gain[i][i] = -1
            for j in range(i+1, n):
                gain[i][j] = gain[i+1][j]

    # 実現する結果を探す
    for i in range(n-1):
        vote = 0
        for j in range(n):
            if gain[i][j] > gain[i+1][j]:
                vote += 1
        if vote * 2 > n-i:
            return gain[i]
    return gain[n-1]



if __name__ == '__main__':
    SANTA, PRESENT = map(int, input().split())
    print(*main(SANTA, PRESENT))