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 
/*  MOHD SADIQ  */

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.ArrayList;
import java.math.*;
import java.util.Comparator;

public  class Main {

    public static String reverse(String s){
        return ((new StringBuffer(s)).reverse()).toString();
    }
    public static long parseLong(String s){
        s = s.trim();
        return Long.parseLong(s);
    }

    public static int parseInt(String s){
        s = s.trim();
        return Integer.parseInt(s);
    }

    public static int[] intArray(String[] s){
        int n = s.length;
        int[] a = new int[n];
        for(int i=0;i<n;i++){
            a[i] = Integer.parseInt(s[i]);
        }
        return a;
    }
    public static long[] longArray(String[] s){
        int n = s.length;
        long[] a = new long[n];
        for(int i=0;i<n;i++){
            a[i] = Long.parseLong(s[i]);
        }
        return a;
    }

    public static long pow(long x,long y){
        long res =1;
        while (y>0){
            if(y%2!=0){
                res = res *x;
            }
            y/=2;
            x=x*x;
        }
        return res;
    }

    public static long powMod(long x,long y,long mod ){
        long res =1;
        while (y>0){
            if(y%2!=0){
                res = (res *x)%mod;
            }
            y/=2;
            x=(x*x)%mod;
        }
        return res;
    }

    public static void main(String[] args) throws IOException {

        long mod = (long)Math.pow(10,9)+7;
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String[] s= br.readLine().trim().split(" ");
        long y = parseLong(s[0]);
        long k = parseLong(s[1]);
        long n = parseLong(s[2]);
        if(n-y<=0){
            System.out.println(-1);
            System.exit(0);
        }
        StringBuffer ans = new StringBuffer();
        long a = y/k;
        a++;
        while (a*k<=n){
            ans.append((a*k-y)+" ");
            a++;
        }
        System.out.print(ans.length()==0?"-1":ans);
    }
}
