#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007; // 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
/*-------------------------------------------------*/
int main() {
  cin.tie(0); ios::sync_with_stdio(false);
  // freopen("input.txt", "r", stdin);

  long long l, r; int n; cin >> l >> r >> n;
  if (n == 1) {
    cout << r - l + 1 << '\n';
    return 0;
  }
  vector<long long> ans(n, 0);
  while (l % n != 0 && l <= r) {
    ++ans[l % n];
    ++l;
  }
  while (r % n != n - 1 && l <= r) {
    ++ans[r % n];
    --r;
  }
  if (l < r) {
    REP(i, n) ans[i] += (r - l + 1) / n;
  }
  REP(i, n) cout << ans[i] << '\n';
  return 0;
}