#C6875. Race Winner Determination
Race Winner Determination
Race Winner Determination
In this problem, you are given the number of races y, the speeds of two racers Rahul and Raj (denoted by p and q respectively in meters per minute), and the distances for each race. For each race, the time taken by a racer is computed by the formula \( t = \frac{distance}{speed} \). The racer with the smaller time wins that race. If their times are equal, the race is considered a draw. Your task is to determine the overall winner: if one racer wins more races than the other, output his name; otherwise, output "Draw".
inputFormat
The input is provided via standard input (stdin) and is structured as follows:
1. The first line contains an integer y denoting the number of races.
2. The second line contains two space-separated integers p and q, representing Rahul's speed and Raj's speed respectively (in meters per minute).
3. The third line contains y space-separated integers, where each integer represents the distance (in meters) of a race.
outputFormat
Output a single line (to stdout) that is either "Rahul", "Raj", or "Draw" depending on who wins the majority of races.
## sample5
4 5
400 100 300 200 150
Raj