CF239A.Two Bags of Potatoes

Valera had two bags of potatoes, the first of these bags contains $x$ $(x \ge 1)$ potatoes, and the second — $y$ $(y \ge 1)$ potatoes. Valera — a 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 greater 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.

瓦列拉有两袋土豆，第一袋中有 $x$ $(x \ge 1)$ 个土豆，第二袋中有 $y$ $(y \ge 1)$ 个土豆。瓦列拉是个非常粗心的男孩，因此他弄丢了第一袋土豆（即含 $x$ 个土豆的那袋）。瓦列拉只记得：两袋土豆的总数 $(x + y)$ 满足两个条件：第一，不超过 $n$；第二，能被 $k$ 整除。

请帮助瓦列拉确定第一袋中可能有多少个土豆。将所有满足条件的可能数值按升序输出。

The first line of input contains three integers $y$, $k$, $n$ ($1 \le y, k, n \le 10^9;$ $\frac{n}{k}$ $\le 10^5$).

输入的第一行包含三个整数 $y$、$k$、$n$（$1 \le y, k, n \le 10^9$；$\frac{n}{k}$ $\le 10^5$）。

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$.

输出用空格分隔的整数列表——所有可能的 $x$ 值，按升序排列。每个可能的 $x$ 值应恰好输出一次。

若不存在满足条件的 $x$ 值，则输出单个整数 $-1$。