Traffic Light

Interview

Time limit1sMemory limit1024 MB

Summary

Given drive time M, lap time N, and red interval T, find the laps completed before Mantas first hits a red light, or report that he never stops.

Level: Easy2 of 10
Topics: Math, Simulation
Solved: No attempts yet

Problem

Mantas takes part in a car race. The race track is one lap, and a traffic light stands at the start of the track.

The traffic light is red every T-th minute and green the rest of the time. If the light is red, Mantas stops. If it is green, he keeps driving.

Mantas needs M minutes to drive from the parking lot to the start, and he completes one full lap in N minutes (see the illustration).

The traffic light timer starts when Mantas leaves the parking lot. Determine whether Mantas has to stop at the light, and if so, how many full laps he completes before his first stop.

Input

The input contains one line with three positive integers: M, the number of minutes it takes Mantas to drive from the parking lot to the start, N, the number of minutes for one full lap, and T, the interval in minutes at which the light turns red.

Output

If Mantas has to stop, print the number of full laps he completes before his first stop.

If Mantas never stops at the light, print NESUSTOS.

Constraints

1 ≤ N, M, T ≤ 10 000

Examples2

Example 1
Input
```
4 9 15
```
Expected output
```
NESUSTOS
```
Example 2
Input
```
18 17 16
```
Expected output
```
14
```