Maratona de Programação da SBC Brasil
"Stop thief! Stop thief!" Stole the purse of an innocent lady who was walking on the beach and Nlogonia thief fled toward the sea. His plan seems obvious: he intends to take a boat and escape!
The fugitive, who by now is aboard their vessel leakage, intends to follow the coast perpendicularly toward the limit of international waters, which is 12 nautical miles away, where will be saved from local authorities. Your boat can travel that distance at a constant speed of VF us.
The Coast Guard intends to intercept him, and your boat has a constant speed of VG us. Assuming both boats departing the coast at exactly the same instant, with a distance of D nautical miles between them, can be possible that the Coast Guard reach the thief before the limit of international waters?
Assume the coast of Nlogonia is perfectly straight and the sea calm enough, to allow a trajectory so as retilíınea the coast.
The input consists of several test cases. Each test case is described in a line containing three integers, D (1 ≤ D ≤ 100), VF (1 ≤ VF ≤ 100) and VG (1 ≤ VG ≤ 100), indicating the initial distance between the fugitive and the Coast Guard, the runaway boat speed and the Coast Guard boat speed.
For each test case print a line containing 'S' if the Coast Guard can reach the fugitive before he exceeds the limit of international waters or 'N' otherwise.
|Sample Input||Sample Output|
5 1 12