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

int main(){
	long long l,r;
	int n;
	cin >> l >> r >> n;
	vector<int> mo;
	for(long long i=l;i<=r;i++){
		if(i==l){
			mo.push_back(i%n);
			continue;
		}else{
			if(mo[0]==i%n){
				break;
			}else{
				mo.push_back(i%n);
			}
		}
	}

	vector<long long> cnt(mo.size(),(r-l+1)/mo.size());
	
	long long add=(r-l+1)%mo.size();
	
	for(long long i=0;i<add;i++){
		cnt[mo[i]]++;
	}
	
	sort(mo.begin(),mo.end());
	
	for(long long i=0;i<mo.size();i++){
		cout << cnt[mo[i]] << endl;
	}

	return 0;
}