#include<iostream>
#include<algorithm>
#include <vector>
#include<cmath>
#include<iomanip>
#include<queue>
using namespace std;
typedef long long int lont;
int main() {
	int l, r, n;
	cin >> l >> r >> n;
	int cnt = 0;
	for (int ia = 0; ia < n; ia++) {
		for (int ib = l; ib <= r; ib++) {
			if (ib % n == ia) {
				cnt++;
			}
		}
		cout << cnt << endl;
		cnt = 0;
	}
}