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 
import java.io.*;

public class Main {
	public static void main(String[] args)throws Exception{
		solve();
	}
	public static void solve() throws IOException {
		FastScanner fscan = new FastScanner(System.in);
		BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
		long y = fscan.nextInt();
		long k = fscan.nextInt();
		long n = fscan.nextInt();

		long t = y/k + 1;
		if(t*k > y && t*k <= n ){
			while(t*k <= n){
				bw.append(String.valueOf(t*k - y));
				bw.append(" ");
				t++;
			}
		}else{
			System.out.print(-1);
		}
		bw.close();
	}
}



class IO {
	
	/**
	 * read into a[0, N) 
	 */
	public static void readIntArray(int a[],int N, FastScanner fscan) throws IOException{
		readIntArray(a,N,0,N,fscan);
	}
	/**
	 * read into a[start, end) 
	 */
	public static void readIntArray(int a[],int N, int start, int end, FastScanner fscan) throws IOException{
		if(end - start != N){
			throw new RuntimeException("Array size mismatch.");
		}
		for (int i = start; i < end; i++) {
			a[i] = fscan.nextInt();
		}
	}
}

class FastScanner {
	InputStream is;
	byte buff[] = new byte[1024];
	int currentChar = -1;
	int buffChars = 0;
	
	public FastScanner(InputStream inputStream){
		is = inputStream;
	}

	public boolean hasNext() throws IOException{
		return buffChars >= 0;
	}
	public char nextChar() throws IOException{
		//if we already have that next char read, just return else input
		if(currentChar == -1 || currentChar >= buffChars){
			currentChar = 0;
			buffChars = is.read(buff);
		}

		if(buffChars <= 0){
			throw new RuntimeException("No char found...");
		}
		return (char) buff[currentChar++];
	}
	
	public String nextString() throws IOException{
		StringBuilder bldr = new StringBuilder();
		int ch;
		while(isSpace(ch = nextChar()));

		do {
			bldr.append((char)ch);
		}while(!isSpace(ch = nextChar()));
		
		return bldr.toString();
	}
	
	public int nextInt() throws IOException{
		//considering ASCII files--> 8 bit chars,     unicode files has 16 bit chars (byte1 then byte2)
		int result = 0;
		int sign = 1;
		int ch;
		while(isSpace(ch = nextChar()));

		if(ch == '-')	{
			sign = -1;
			ch = nextChar();
		}

		do {
			if(ch < '0' || ch > '9')
				throw new NumberFormatException("Found '" + ch + "' while parsing for int.");
			
			result *= 10;
			result += ch - '0';
		}while(!isSpace(ch = nextChar()));
		
		return sign * result;
	}
	
	public long nextLong() throws IOException{
		//considering ASCII files--> 8 bit chars,     unicode files has 16 bit chars (byte1 then byte2)
		long result = 0;
		int sign = 1;
		int ch;
		while(isSpace(ch = nextChar()));

		if(ch == '-')	{
			sign = -1;
			ch = nextChar();
		}

		do {
			if(ch < '0' || ch > '9')
				throw new NumberFormatException("Found '" + ch + "' while parsing for int.");
			
			result *= 10;
			result += ch - '0';
		}while(!isSpace(ch = nextChar()));
		
		return sign * result;
	}
	private boolean isSpace(int ch){
		return ch=='\n' || ch==' ' || ch=='\t' || ch=='\r' || ch == -1;
	}
	
	public void close()  throws IOException{
		is.close();
	}
}