#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep3(i, l, n) for (int i = l; i < n; ++i)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define out(a) cout << a << endl
#define SZ(v) (int)v.size()


ll remainder_catch(ll r, ll div, ll mod) {
    ll ret = r / div;
    if (mod == 0) return ret;
    //余り0でなかったら残りを分配
    if (r % div == mod) ret++;
    return ret;
}
ll nums_remainder(ll l, ll r, ll div, ll mod) {
    return remainder_catch(r, div, mod) - remainder_catch(l - 1, div, mod);
}
int main() {
    ll l, r; int n;
    cin >> l >> r >> n;
    
    rep(i, n) out(nums_remainder(l, r, n, i));
    
}