codeforce 11 04 A

A. Two Bags of Potatoes

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 ≤ 10⁹;  ≤ 10⁵).

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.

Sample test(s)

Input

10 1 10

Output

-1

Input

10 6 40

Output

2 8 14 20 26 




这道题只要想到了就好做啦。。

  由于m最大值有10^9，所以不能直接做；

  换一种思考方式。。。从k的角度考虑其总和就行啦。

 

 

代码：

 

#include<iostream>
using namespace std;
int main(){
    int n,m,k;
    while(cin>>n>>k>>m){
           if(m<=n){
               cout<<"-1"<<endl;
               continue;
               }
           int times=0;
           for(int i=1;i*k<=m;i++){
                   if(times!=0)
                        cout<<" ";
                   if(i*k>n){
                       cout<<i*k-n;
                       times++;
                       }
                       }
           if(times==0){
                cout<<"-1"<<endl;
                continue;
                }
           cout<<endl;
                       }
    return 0;
}