#include <algorithm>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
using std::cerr;
using std::cin;
using std::cout;
using std::endl;

int main(void) {
  cout << std::fixed << std::setprecision(10);
  cin.tie(0);
  std::ios::sync_with_stdio(false);

  int64_t l, r, n;
  cin >> l >> r >> n;
  int64_t result[100000] = {};
  int64_t remain         = r % n;
  for (int i = 0; i < n; i++) {
    if (i < remain) {
      result[i] = r / n + 1;
    } else {
      result[i] = r / n;
    }
  }
  if (l - 1 > 0) {
    for (int i = 0; i < n; i++) {
      if (i < remain) {
        result[i] -= (l - 1) / n + 1;
      } else {
        result[i] -= (l - 1) / n;
      }
    }
  }

  cout << result[n - 1] << endl;
  for (int i = 0; i < n - 1; i++) {
    cout << result[i] << endl;
  }

  return 0;
}