|
||||||||||
JsljgameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 58 Accepted Submission(s): 20 Problem Description Jslj and Penguin like playing games very much. One day Jslj come up with a good idea. There are $n$ piles of stones, where the $i$-th pile has $a_i$ stones. Jslj and Penguin take alternating turns removing stones. Jslj goes first. In a move, Jslj can remove a positive number of stones except for $x$ from any pile, Penguin can remove a positive number of stones except for $y$ from any pile. The first player who can't make a move loses the game. Your task is to determine who is winner. Input The first line contains an integer $T$ $(1\le T\le 2000)$ representing the number of test cases. For each test case, the first contain three integers $n,x,y$$(1 \le n \le 10^3 , 1 \le x,y \le 10^9)$ representing the number of piles, the number of stones Jslj can't remove, the number of stones Penguin can't remove. The second line contain n integers $a_i$$(1 \le a_i \le 10^9)$, $a_i$ is the number of stones in the $i$-th pile. Output For each test case, if Jslj wins, output Jslj. Otherwise, output yygqPenguin. Sample Input
Sample Output
Source | ||||||||||
|