#include <bits/stdc++.h>
int main() {
  int y, n, k;
  while (scanf("%d%d%d", &y, &k, &n) != EOF) {
    bool find = false;
    bool first = false;
    for (int i = 1; i * k <= n; ++i) {
      int temp = i * k;
      if (temp > y && temp <= n) {
        if (first) putchar(' ');
        printf("%d", i * k - y);
        first = true;
        find = true;
      }
    }
    if (!find) printf("-1");
    putchar('\n');
  }
  return 0;
}
