239A.md (1160B)
1 Source: https://codeforces.com/problemset/problem/239/A 2 3 A. Two Bags of Potatoes 4 5 time limit per test 6 7 0.5 seconds 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 stdin 16 17 output 18 19 stdout 20 21 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$. 22 23 Help Valera to determine how many potatoes could be in the first bag. Print all such possible numbers in ascending order. 24 25 Input 26 27 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$). 28 29 Output 30 31 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. 32 33 If there are no such values of $x$, print a single integer $-1$. 34 35 Examples 36 37 Input 38 39 ``` 40 10 1 10 41 ``` 42 43 Output 44 45 ``` 46 -1 47 ``` 48 49 Input 50 51 ``` 52 10 6 40 53 ``` 54 55 Output 56 57 ``` 58 2 8 14 20 26 59 ```