#include <bits/stdc++.h>
using namespace std;
int tree[10000], n = 10;
int query(int idx) {
  int sum = 0;
  while (idx > 0) {
    sum += tree[idx];
    idx -= (idx & -idx);
  }
  return sum;
}
void update(int idx, int val) {
  while (idx <= n) {
    tree[idx] += val;
    idx += (idx & -idx);
  }
}
int ara[1000000];
int main() {
  int i, j, m, k = 0, y, l, p, q, rem = 0, rem1 = 0;
  cin >> y >> k >> n;
  p = y / k;
  p++;
  for (i = p;; i++) {
    q = i * k;
    if (q <= n)
      ara[rem++] = q - y;
    else
      break;
  }
  if (rem) {
    for (i = 0; i < rem; i++) cout << ara[i] << " ";
    cout << endl;
  } else
    cout << "-1\n";
  return 0;
}
