]> UT UPE :: Problem A

Problem Description

Its Saturday night and Robert is planning to watch a movie online. However, his internet is often flaky and Robert wants to watch the movie uninterrupted. So, he plans to let the movie buffer for a while and then start watching.

For example, if the length of the movie is 1 hour and the size of the movie is 3612 bytes and the download speed is 1 bytes/s, Robert needs to wait 12 seconds to buffer and download 12 B during those 12 seconds. After 12 seconds, Robert can watch the movie uniterrupted for the next 1 hour (3600 seconds) as he lets the movie download simultenously as he watches it.

Robert knows the length of the movie and the size of the movie and his internet speed and he wants to write a program to help him decide how long he has to wait for an uninterrupted Saturday night online movie experience.

Input Format

There will be several test cases.

Each test cases consists of a line with 3 positive integers D, S, and L. They will all fit into 32-bit signed integers. Where L is the length of the movie in seconds, S is the size of the movie in bytes, and D is the download speed in bytes/seconds.

Input will end with a line containing "0 0 0". Do not process this case.

Output Format

For each test case, output the minimum time Robert needs to wait for the movie to buffer so that he can watch the rest of the movie uninterrupted.

If Robert does not needs to wait at all (this happens when there is really fast download speed), output "Robert does not need to wait at all!". If Robert needs to wait for greater than or equal to 24 hours to buffer, output "Robert needs to get a faster internet!". Otherwise, output "Robert needs to wait for: T seconds." where T is rounded till the thousandth decimal place.

Sample Input

1 3612 3600 
10 1000000000 1
100 1 2
0 0 0

Sample Output

Robert needs to wait for: 12.000 seconds.
Robert needs to get a faster internet!
Robert does not need to wait at all!