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

V = [1]*N

for i in range (2, 100001):
    def is_ok(arg):
        return arg*i <= K*(arg+i+(N-2))

    def meguru_bisect(ng, ok):
        while (abs(ok - ng) > 1):
            mid = (ok + ng) // 2
            if is_ok(mid):
                ok = mid
            else:
                ng = mid
        return ok

    laid = meguru_bisect(10**150 + 1, 0)
    if laid*i == K*(laid+i+(N-2)):
        V[-1] = laid
        V[-2] = i
        print(*V)
        exit()