# 最後の2項以外は1で作ることを考えよう
# 式変形すれば (a1-K)*(a2-K)=K*(K+N-2)

N, K = map(int, input().split())

def divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]

RHS = K*(K+N-2)
divs = divisors(RHS)
for d1 in divs:
    d2 = RHS//d1
    ans = [1]*(N-2) + [d1+K] + [d2+K]
    print(*ans)
    break