Valera had two bags of potatoes, the first of these bags contains x (x ≥ 1) potatoes, and the second — y (y ≥ 1) potatoes. Valera — very scattered boy, so the first bag of potatoes (it contains x potatoes) Valera lost. Valera remembers that the total amount of potatoes (x + y) in the two bags, firstly, was not gerater than n, and, secondly, was divisible by k.

Help Valera to determine how many potatoes could be in the first bag. Print all such possible numbers in ascending order.

Input

The first line of input contains three integers y, k, n (1 ≤ y, k, n ≤ 109; <image> ≤ 105).

Output

Print the list of whitespace-separated integers — all possible values of x in ascending order. You should print each possible value of x exactly once.

If there are no such values of x print a single integer -1.

Examples

Input

10 1 10


Output

-1


Input

10 6 40


Output

2 8 14 20 26 
#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
long long dx[] = {-1, 1, 0, 0, -1, 1, -1, 1};
long long dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
void fast() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
}
long long gcd(long long x, long long y) {
  if (!y) return x;
  return gcd(y, x % y);
}
long long lcm(long long x, long long y) { return (x / gcd(x, y)) * y; }
long long fastpow(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b % 2) res *= a;
    b /= 2, a *= a;
  }
  return res;
}
bool isprime(long long n) {
  if (n == 1 || n == 0) return 0;
  for (long long i = 2; i <= sqrt(n); i++)
    if (n % i == 0) return 0;
  return 1;
}
long long ceilval(long long a, long long b) { return (a / b) + ((a % b) != 0); }
bool getbit(long long num, long long index) { return (num & (1 << index)); }
int findNum(int N, int K) {
  int rem = (N + K) % K;
  if (rem == 0)
    return N;
  else
    return N + K - rem;
}
void solve() {
  int y, k, n;
  cin >> y >> k >> n;
  bool found = false;
  int a = findNum(y, k);
  for (int i = a; i <= n; i += k) {
    int x = i - y;
    if (x) {
      cout << x << " ";
      found = true;
    }
  }
  if (!found) cout << "-1\n";
}
int main() {
  fast();
  solve();
}
