#include <bits/stdc++.h>
using namespace std;
int main() {
  long long y, k, n;
  cin >> y >> k >> n;
  queue<long long> q;
  long long c = k - (y % k);
  if (c + y <= n) q.push(c);
  for (long long i = c + k; y + i <= n; i += k) {
    q.push(i);
  }
  if (q.empty()) {
    cout << -1;
    return 0;
  }
  while (!q.empty()) {
    cout << q.front() << " ";
    q.pop();
  }
  return 0;
}
