#include <vector>
#include <iostream>
#include <algorithm>
#include <functional>
#include <string>
#include <math.h>
#include <map>
using namespace std;

int main(){
	long long l,r,n;
	cin >> l >> r >> n;
	long long len=(r-l+1)/n;
	long long mo=(r-l+1)%n;
	vector<long long> a;
	vector<long long> cnt(n,0);
	
	for(long long i=0;i<=(r-l);i++){
		long long temp=i+l;
		if(i>0){
			if(temp%n==a[0])break;
		}
		a.push_back(temp%n);
		cnt[a[i]]+=len;
		if(i<mo)cnt[a[i]]+=1;
		
	}
	
	sort(a.begin(),a.end());
	
	for(long long i=0;i<a.size();i++){
		cout << cnt[a[i]] << endl;
	}
	
	return 0;
}