#include<iostream>
#include<algorithm>
#include <vector>
#include<cmath>
#include<iomanip>
#include<queue>
using namespace std;
typedef long long int lont;
int main() {
	lont l, r, n;
	cin >> l >> r >> n;
	vector<lont>veca(n);
	lont ia = l;
	lont ib = r;
	while (ia % n != 0) {
		veca.at(ia % n)++;
		ia++;
	}
	while (ib % n != n-1) {
		veca.at(ib % n)++;
		ib--;
	}
	for (int ic = 0; ic < n; ic++) {
		veca.at(ic) += (ib - ia+ 1) / n;
	}
	for (int id = 0; id < n; id++) {
		cout << veca.at(id) << endl;
	}
}