#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
using namespace std;
#define lint long long int
/*
vector<char>al(26);
al = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
vector<char>AL(26);
AL = {'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
*/

int main() {
	lint l, r, n;
	cin >> l >> r >> n;
	vector<lint>vec(n);
	lint a;
	a = r - l + 1;
	if (l % n != 0) {
		a -= (n - l % n);
	}
	if (r % n != n - 1) {
		a -= (r % n + 1);
	}
	a /= n;
	for (int i = 0; i < n; i++) {
		vec.at(i) += a;
	}

	/*for (int i = 0; i < n; i++) {
		cout << vec.at(i) << endl;
	}*/

	if (l % n != 0) {
		for (lint i = 0; i < (n - l % n); i++) {
			vec.at(l%n + i)++;
		}
	}
	if (r % n != n - 1) {
		for (int i = 0; i < r % n + 1; i++) {
			vec.at(r%n - i)++;
		}
	}
	for (int i = 0; i < n; i++) {
		cout << vec.at(i) << endl;
	}
}