#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
#include <iomanip>


using namespace std;

#define REP(i, n) for(ll i = 0;i < n;i++)
#define REPR(i, n) for(ll i = n;i >= 0;i--)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define FORR(i, m, n) for(ll i = m;i >= n;i--)
#define REPO(i, n) for(ll i = 1;i <= n;i++)
#define ll long long
#define INF (ll)1 << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(),n.end()
#define MOD (ll)1000000007
#define P pair<ll, ll>


ll l, r, n, ans[110000];
int main() {
	cin >> l >> r >> n;
	REP(i, n) {
		ans[i] += (r - l + 1) / n;
	}
	l %= n;
	r = (r + 1 )% n;
	while (1) {
		if (l == r)break;
		ans[l]++;
		l = (l + 1) % n;
		//if (l == r)break;
	}
	REP(i, n)cout << ans[i] << endl;
}