13:I[87,["736","static/chunks/89fc4f0e-9e200ae6a0166583.js","401","static/chunks/363642f4-32903b9154b7835a.js","153","static/chunks/153-58eddeb032cc4608.js","131","static/chunks/131-05ce00cfd760e12b.js","87","static/chunks/87-b76b60eef573119a.js","286","static/chunks/app/problem/%5Bid%5D/page-45cf3875257fc32e.js"],"Header"] 14:I[1742,["736","static/chunks/89fc4f0e-9e200ae6a0166583.js","401","static/chunks/363642f4-32903b9154b7835a.js","153","static/chunks/153-58eddeb032cc4608.js","131","static/chunks/131-05ce00cfd760e12b.js","87","static/chunks/87-b76b60eef573119a.js","286","static/chunks/app/problem/%5Bid%5D/page-45cf3875257fc32e.js"],"ProblemView"] 15:T58f,

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.

Input

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

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

Two Bags of Potatoes

Examples