A. Fundraising the Game
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Jimmy is trying to set up a large game for 456 people, but instead of using his own money, he wants to finance it through various donators. Fortunately for him, he has various benefactors that want to see the game come to life, and as such, he has acquired various sources of money.

Given the budget required to run the game, and $$$n$$$ sources of income, determine if Jimmy can successfully run his game.

Input

The first line of input will contain $$$n$$$ $$$(1 \le n \le 10^3)$$$, the number of benefactors, and $$$b$$$ $$$(1 \le b \le 10^6)$$$, the budget needed for the game.

The next $$$n$$$ lines will each contain $$$c_i$$$ $$$(1 \le c_i \le 10^3)$$$, the contribution for the $$$i^{th}$$$ benefactor.

Output

Output Success if the games can be run with extra money leftover, More funding required if there are insufficient funds, and finally Just enough if there is just perfectly enough money without any leftover.

Example
Input
3 1000
100
200
700
Output
Just enough