407707: GYM102878 I Nobody Knows Better Than Me

Memory Limit:256 MB Time Limit:1 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

I. Nobody Knows Better Than Metime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard output

It's election year in Byteland! This year, Iden and Rump are competiting for becoming the next president of Byteland. The election rule of the Byteland is pretty simple. Each citizen in the Byteland has the right to vote for his preferred president. The Byteland consists of several states. Internal to some state, if the total number of citizens in this state voting for Iden is greater than the total number of citizens in this state voting for Rump, then Iden gets one score from this state, and vise versa. Finally, the one that gets more score wins and will become the next president of Byteland.

Rump really wants to win the election. Since nobody knows election better than Rump, Rump has prepared the election data from the last election. The data contains the percentage of citizens in each state that voted for Rump and Illary (the opponent to Rump in the last election) in the last election. With some investigation, Rump finds that he can change citizens' mind in this election by giving impressive speeches. Specifically, for a state Rump lost in the last election (i.e. the total number of citizens in this state voting for Illary was greater than the total number of citizens in this state voting for Rump in the last election), Rump can spend $$$\left\lceil\frac{l - w}{2}\right\rceil$$$ units of time in this state giving a speech to turn citizens' mind and ensure getting score from this state this time. If Rump doesn't spend enough time in this state, then he will lose this state again this time. $$$l$$$ is the percentage of citizens that voted for Illary and $$$w$$$ is the percentage of citizens that voted for Rump in the last election. For a state that Rump won in the last election, Rump is very sure that he will also win this state this time and so Rump doesn't have to make efforts on these states this time.

Rump's time is very limited since he is busy tweeting every day. He only has $$$t$$$ units of free time which he can spend for traveling around and giving speeches to citizens. He wants to know whether he has the opportunity to win the election this time. Can you help him?

Input

The first line of input contains two space-separated integers $$$n$$$ and $$$t$$$ $$$\left(1 \le n \le 2 \times 10^5, 0 \le t < 2^{31}\right)$$$ which represents the number of states in the Byteland and the total units of free time Rump has, respectively. It's guaranteed that $$$n$$$ is odd so there couldn't be a tie between Iden and Rump.

Then there are $$$n$$$ lines of input, the $$$i$$$-th line of which contains two space seperated integers $$$l_i$$$ and $$$w_i$$$ $$$\left(0 \le l_i, w_i \le 100, l_i + w_i = 100, l_i \neq w_i\right)$$$ which represents the percentage of citizens who voted for Illary and Rump in the last election, respectively.

Output

If Rump has the opportunity to win the election this time, output "Make Byteland Great Again!" on a separate line; otherwise output "Fake Polls!" on a separate line.

ExamplesInput
5 10
40 60
49 51
55 45
53 47
36 64
Output
Make Byteland Great Again!
Input
5 4
49 51
53 47
55 45
56 44
62 38
Output
Fake Polls!
Note

In the first given example test case, Rump doesn't have to make any effort to ensure his winning since he is very sure that he will win the first, second and fifth state;

In the second given example however, Rump has no way to win the election since he does not have enough time.

加入题单

上一题 下一题 算法标签: