Welcome to the I Hate Ready To Program Series! This series aims to teach you templates of various algorithms that are used in CP. Let's begin with a simple implementation problem, shall we?

You just started ICS class and you are being introduced to Ready to Program! On your first assignment, you are to create a very simple program. However, to your horror, as you click "run", the console never appears! Confused, you look at your program again. You notice you have ~N~ lines in your program. Thinking that RtP is probably not running because you have too many lines in your program, you ask the other ~S~ students in your class for the amount of lines they have in their program. You decide to take the average of all the values (not including yours), rounded down, to have a general sense of the limit of the amount of lines RtP can handle before it refuses to run. From your calculations, does your program have too many lines or is RtP being weird again?

NOTE: The original test data was weak, so an extra test case was added and all submissions were rejudged.

Constraints

~1 \leq N,S \leq 10^3~

~1 \leq l_i \leq 10^3~

Input Specifications

The first line contains two space-separated integers, ~N,S~.

The next line contains ~S~ space-separated integers, ~l_1,l_2,l_3,...,l_S~, the number of lines each of the other students have in their code.

Output Specifications

Output Too many lines! if your program has more than or equal to the average number of lines in your class, or RtP moment... otherwise.

Sample Input

3 2
6 8

Sample Output

RtP moment...