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

dp = [set() for i in range(N)]
for i in range(N):
    if not dp[i]:
        for j in range(i+1,min(i+K+1,N)):
            dp[j].add(j-i)
    elif len(dp[i])==1:
        for k in dp[i]:
            if i+k < N:
                dp[i+k].add(k)

#print(dp)
if dp[N-1]:
    dp[N-1] = sorted(dp[N-1])
    print(*dp[N-1],sep="\n")
else:
    print(0)