def solve(le, ri, n):
    w = ri - le + 1
    num_seq, rest = divmod(w, n)
    res = [num_seq] * n
    init_mod = le % n
    for i in range(init_mod, init_mod + rest):
        res[i % n] += 1
    return res


def main():
    le, ri, n = (int(z) for z in input().split())
    res = solve(le, ri, n)
    print(*res, sep="\n")


if __name__ == "__main__":
    main()