#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;

typedef vector<unsigned int>vec;
typedef vector<vec> mat;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline void add(T &a, T b){a = ((a+b) % MOD + MOD) % MOD;};

int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll l,r,n;
    cin>>l>>r>>n;
    vector<ll> amari(n);

    if(n==1){
        cout<<r-l+1<<endl;
        return 0;
    }
    for(int i=0;i<n;i++){
        if(i+l>r) break;
        amari[(i+l)%n]++;
    }
    
    for(ll i = r/n*n+(l%n);i<=r;i++){
        amari[i%n]++;
    }
    if(r-l>1){
        REP(i,n){
            amari[i] += (r-l+1) / n - 1;
        }
    }
    REP(i,n) cout<<amari[i]<<endl;
}