#include <bits/stdc++.h>
using namespace std;
struct datastructure {
  multiset<long long> m1, m2;
  long long sum, k;
  datastructure(long long ab) {
    sum = 0;
    k = ab;
  }
  void add(long long x) {
    m1.insert(x);
    sum += x;
    if ((long long)m1.size() > k) {
      long long a = *(m1.begin());
      sum -= a;
      m1.erase(m1.find(a));
      m2.insert(a);
    }
    return;
  }
  void remove(int x) {
    if (m2.find(x) != m2.end()) {
      m2.erase(m2.find(x));
    } else if (m1.find(x) != m1.end()) {
      sum -= x;
      m1.erase(m1.find(x));
      if (m2.empty()) return;
      long long b = *(m2.rbegin());
      sum += b;
      m2.erase(m2.find(b));
      m1.insert(b);
    }
    return;
  }
  long long getsum() { return sum; }
};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  long long n, m, a, b, t, k, x, y, w, h, q;
  cin >> y >> k >> n;
  x = k - y;
  if (y >= n) {
    cout << -1;
  } else {
    bool flag = true;
    long long i = 2;
    while (x < 1) {
      x = i * k - y;
      i++;
    }
    if (x + y > n)
      cout << -1;
    else {
      while (x + y <= n) {
        flag = false;
        cout << x << " ";
        x = i * k - y;
        i++;
      }
    }
  }
}
