Limits 1s, 512 MB

A different type of football tournament is being played between Argentina and other teams. We all want to see Argentina in the final of the tournament, don't we? Let's determine whether Argentina will play the final or not!

There will be a total of NN matches played in this tournament. Argentina will play the opening match. If Argentina wins the current match, they skip the next match. If not, they play the next match.

Given an array aa of size N,N, where aia_i represents the points exactly needed to win the ithi^{th} match.

In a match, Argentina will score XX points for each goal. Argentina can give as many goals as they want in a match. So if it is possible to win a match by scoring aia_i points, Argentina will always win that match.

The NthN^{th} match is the final match. If Argentina plays in the final match, they will win somehow.

So, you have to determine if Argentina can play in the final match or not.


The first line of the test case contains two integers NN and XX separated by space — indicating the number of matches and points for each goal, respectively.

The second line contains NN integers a1,a2,.,ana_1,a_2,.…,a_n— indicating the elements of the array.

1N,X1051≤N, X≤10^5

1ai1091 \le a_i \le 10^9


Output "Yeee! Argentina" (without quotes) if Argentina won the tournament and "Messi missed the penalty!" (without quotes) otherwise.

Check out the samples for clarification.


5 3
1 2 3 4 5
Yeee! Argentina

First two match is lost by Argentina because if Argentina scores at least one goal their points will be 3 each but they have to get exactly 1 and 2 points respectively. Third match is won by Argentina by scoring one goal. Fourth match will be skipped as they won third match and they will reach to the final.

5 4
1 2 3 4 5
Messi missed the penalty!


Login to submit.


54% Solution Ratio
Hamza_2305101680Earliest, 9M ago
leviathan_09Fastest, 0.0s
user.2473Lightest, 4.9 MB
Rakin.1859Shortest, 248B
Toph uses cookies. By continuing you agree to our Cookie Policy.