PROGRAMMING:Dream of ZF series
Everyone may have dreamed of becoming a hero in his childhood, especially the boy who likes martial arts, ZF is no exception.
In his childhood, he often dreamed that he would become a great hero, holding a shining sword in his hand and a beautiful lady with long hair, Take a walk on the path by the quiet spring. The breeze blows and two maple leaves fall......
It's just because he indulges in this kind of artistic conception of seclusion all day long that he is still alone and can only walk alone in the crowd every day......
Now let's create an opportunity for this poor man. Suppose that ZF has captured a MM's heart, but the MM is captured by the evil and extremely hateful big devil (AC female killer Uncle Wang: PS smile). For justice, for mm, burn......
OK, let's officially start our journey. Next, there will be 10 levels waiting for ZF. Let's help him overcome the evil smiling demon.
In front of the Holy Spirit temple where the great devil lives, ZF sees a pile of Holy Spirit stones. After careful study, it turns out that this is the way to open the entrance of the ancient temple.
Each Holy Spirit stone has a mysterious number, and the number of all holy spirit stones added together is the mantra to open the ancient temple....
Given the number of Holy Spirit stone n, n is not 0, the smallest Holy Spirit stone number m, each adjacent number difference X
Can you tell ZF the sum of their numbers?
###Input format:
The number of Holy Spirit stone is n, the smallest Holy Spirit stone number is m, and the number difference of each adjacent stone is X
###Output format:
Sum of numbers
###Input example:
Here is a set of inputs. For example:
```in
429 760 6
```
###Output example:
The corresponding output is given here. For example:
```out
eight hundred and seventy-six thousand eight hundred and seventy-six
```
answer：If there is no answer, please comment
In his childhood, he often dreamed that he would become a great hero, holding a shining sword in his hand and a beautiful lady with long hair, Take a walk on the path by the quiet spring. The breeze blows and two maple leaves fall......
It's just because he indulges in this kind of artistic conception of seclusion all day long that he is still alone and can only walk alone in the crowd every day......
Now let's create an opportunity for this poor man. Suppose that ZF has captured a MM's heart, but the MM is captured by the evil and extremely hateful big devil (AC female killer Uncle Wang: PS smile). For justice, for mm, burn......
OK, let's officially start our journey. Next, there will be 10 levels waiting for ZF. Let's help him overcome the evil smiling demon.
In front of the Holy Spirit temple where the great devil lives, ZF sees a pile of Holy Spirit stones. After careful study, it turns out that this is the way to open the entrance of the ancient temple.
Each Holy Spirit stone has a mysterious number, and the number of all holy spirit stones added together is the mantra to open the ancient temple....
Given the number of Holy Spirit stone n, n is not 0, the smallest Holy Spirit stone number m, each adjacent number difference X
Can you tell ZF the sum of their numbers?
###Input format:
The number of Holy Spirit stone is n, the smallest Holy Spirit stone number is m, and the number difference of each adjacent stone is X
###Output format:
Sum of numbers
###Input example:
Here is a set of inputs. For example:
```in
429 760 6
```
###Output example:
The corresponding output is given here. For example:
```out
eight hundred and seventy-six thousand eight hundred and seventy-six
```
answer：If there is no answer, please comment