Basketball Player

Time limit1sMemory limit128 MB

Summary

Given current height k, required height w and growth m per hit, compute the fewest hits needed to reach w.

Level: Easy1 of 10
Topics: Math
Solved: No attempts yet

Problem

Kozik dreams of becoming a basketball player. After talking with the coach, it turned out that he is too short. Kozik is so determined, however, that he wants to meet the coach's requirement even if it amounts to cheating. So he came up with a brilliant idea: giving himself bumps on the head until he reaches the required height. He noticed that with each hit the bump grows by $m$ cm. Kozik wonders the minimum number of times he will have to hit himself.

Input

The first line of input contains three integers $k$ , $w$ , $m$ ( $1 \le k \le 200$ , $1 \le w, m \le 10^9$ ), denoting respectively Kozik's current height, the height required by the coach, and how much the bump grows after each hit.

Output

The first and only line of output should contain a single integer equal to the minimum number of hits Kozik must perform.

Examples1

Example 1
Input
```
180 202 10
```
Expected output
```
3
```