#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
const double eps = 1e-9;
long long int y, k, n;
void solve() {
  cin >> y >> k >> n;
  vector<long long int> ans;
  int i = 0;
  if (y > k) {
    if (y % k == 0) {
      i = k;
    } else {
      i = ((y + k - 1) / k) * k;
      i = i - y;
    }
  } else {
    if (y == k)
      i = k;
    else
      i = k - y;
  }
  for (; i + y <= n;) {
    ans.push_back(i);
    i += k;
  }
  if ((int)ans.size()) {
    for (int i : ans) {
      cout << i << " ";
    }
  } else
    cout << -1;
  cout << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int test = 1;
  while (test--) solve();
  return 0;
}
