#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

int main() {
    int64_t l, r, n;
    cin >> l >> r >> n;
    int64_t lmin = l, lmax = (l + n - 1) / n * n;
    int64_t rmin = r / n * n, rmax = r + 1;
    vector<int64_t> ans(n);
    if (lmax <= rmin) {
        for (auto i = 0; i < n; ++i) {
            ans[i] = (rmin - lmax) / n;
        }
        for (auto ll = lmin; ll < lmax; ++ll) {
            ++ans[ll % n];
        }
        for (auto rr = rmin; rr < rmax; ++rr) {
            ++ans[rr % n];
        }
    } else {
        for (auto i = l; i <= r; ++i) {
            ++ans[i % n];
        }
    }
    for (auto i = 0; i < n; ++i) {
        cout << ans[i] << endl;
    }
    return 0;
}