Given that, there are N paths numbered from 1 to N, where each path connects the starting point S to the destination point X. The maximum speed limit is speed[i] for the \(i^{th}\) path which can be used to reach the destination. Find the path to reach the destination as early as possible. If there are multiple paths from which you can choose, print Many Roads. Also, it is guaranteed that X will always be greater than S.

Input format:
First line will contain the number of test cases T.
Each test case will be as follows:
First line consists of S, X and N, which denotes the starting point, destination point and number of paths respectively.
Next line will contain N numbers that denote maximum speed limit of the paths.

Output Format:
For each test case, output a single integer denoting the path chosen to reach the destination as early as possible. If there are multiple paths from which you can choose, you have to output "Many Roads" without quotes.

Input Constraints:
\(1 \le T \le 100\)
\(1 \le N \le 10^5\)
\( 0 \le \)S, \(X \le 10^9\)
\(1 \le speed[i] \le 10^9\)