time limit per test: 2 seconds memory limit per test: 256 megabytes input: standard input output: standard output
at the first week of 2016 Roshan K invited her friends to a party . In the party Roshan K make a game with some stones .the game named with his friends stone jam .
Roshan K says to his friends method of the game : 1: The game have two player . 2: At the first we have n integer number stones . 3: We have m ways to pickup the stones . If a player can’t pick up stones with that m ways the game end and he/she lose the game .
Fortunately the players are very clever and they think about the methods they can play they play the best method to win the game because the price of the game is valuable .
Attention always player 1 start the game .
Input The first line contains a positive integer n ( 1 ≤ n ≤105 ) — the number of stones at the first of the game and positive integer m ( 1 ≤ m ≤539 ) — the number of ways we can pickup the stones.
The second line contains m positive integer ai ( 1 ≤ ai ≤ n ) .
Output Print a string — The player who win . If first player win the game print “Player 1” , if the second player win the game print “Player 2” .
Sample test(s) input 3 3 1 2 3 output Player 1 input 9 2 1 2 output Player 2 Note In the first example Roshan K understands that he can pickup all stones in the first attempt.








