#include <iostream>

using lint = long long;

lint rem(lint x, lint n, lint i) {
    return x < i ? 0 : (x - i) / n + (i != 0);
}

void solve() {
    lint l, r, n;
    std::cin >> l >> r >> n;

    for (lint i = 0; i < n; ++i) {
        std::cout << rem(r, n, i) - rem(l - 1, n, i) << std::endl;
    }
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}