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 
'''
"Do not dwell in the past, do not dream of the future,
concentrate the mind on the present moment."
---BUDDHA

        69696969                         69696969
     6969    696969                   696969    6969
   969    69  6969696               6969  6969     696
  969        696969696             696969696969     696
 969        69696969696           6969696969696      696
 696      9696969696969           969696969696       969
  696     696969696969             969696969        969
   696     696  96969      _=_      9696969  69    696
     9696    969696      q(-_-)p      696969    6969
        96969696         '_) (_`         69696969
           96            /__/  \            69
           69          _(<_   / )_          96
          6969        (__\_\_|_/__)        9696
'''
#from time import time
#start=time()
#from __future__ import division
#from fractions import Fraction
import math
#import random,bisect
#import sys,os
#import random,re
#from sys import stdin, stdout
#from collections import Counter,deque,OrderedDict,defaultdict
#from itertools import permutations,ansduct,combinations
#from heapq import heapify,heappush,heappop,heappushpop,heapify,heapreplace,nlargest,nsmallest
#import numpy as np
#from operator import mul
_CUTOFF=300000
MOD=10**9+7
INF=float('+inf')

def si():
	return str(stdin.readline())
def ii():
    return int(raw_input())
def mi():
    return map(int, raw_input().split())
def li():
    return [int(i) for i in raw_input().split()]
def debug(x):
	return stdout.write(str(x))
def limul(list):
	return eval('*'.join(str(item) for item in list))

"-----------------------------------------------"

def main():
    y,k,n=mi()
    s1=n//k
    s2=y//k
    if s1>s2:
        for i in range(s2+1,s1+1):
            print (k*i-y)
    else:
        print '-1'







    

    





















main()
