#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <string>
#include <map>
#include <iterator>
#include <set>
#include <queue>
#include <bitset>
#include <cassert>

using namespace std;
using ll = long long;

ll f(ll r, ll div, ll mod) {

    ll res = r / div;
    if (mod <= r % div and 0 < mod) {
        res += 1;
    }
    return res;

}


int main() {

    ll l, r;
    cin >> l >> r;
    int n;
    cin >> n;

    for (int i = 0; i < n; ++i) {
        cout << f(r, n, i) - f(l-1, n, i) << endl;
    }

    return 0;

}