#include <bits/stdc++.h>
const int INF = 1 << 29;
using namespace std;
int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(NULL);
  ;
  int y, k, n, cur = 0;
  cin >> y >> k >> n;
  if (y >= n) return cout << -1, 0;
  int pow = 0;
  while (pow < y) pow += k;
  cur = pow - y;
  if (!cur) cur += k;
  vector<int> ans;
  while (y + cur <= n) {
    ans.push_back(cur);
    cur += k;
  }
  if (ans.size() == 0)
    cout << -1;
  else
    for (int i = 0; i < (int)ans.size(); i++) std::cout << ans[i] << ' ';
  std::cout << '\n';
  ;
  return 0;
}
