# 区間 [0..r] で n で割った余りが k となるものの個数を返す
def f(r: int, n: int, k: int) -> int:
    assert n > 0
    assert 0 <= k < n
    d, m = divmod(r, n)

    return d + (k <= m)


L, R, N = map(int, input().split())

for i in range(N):
    cnt = f(R, N, i) - f(L-1, N, i)
    print(cnt)