A. Working With Locks
time limit per test
3 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

It's the first day of summer vacation and school hasn't come along yet to end it! This time, Dr. Doofenshmirtz is up to something again, and it's up to Perry the Platypus to stop him. To get to the mad doctor's lair, Agent P needs to unlock a door that's keeping him captive.

The good news is that Agent P managed to make an imprint of a key and duplicate it. The bad news is that he doesn't know if the key he has matches the lock that's on the door.

The Flynn-Fletcher household has a total of five different locks and five different keys. The keys are numbered #1 to #5. The locks are numbered #1 to #5. In particular:

  • Key #1 can open lock #2.
  • Key #2 can open lock #1 and lock #3.
  • Key #3 can open lock #2 and lock #4.
  • Key #4 can open lock #3 and lock #5.
  • Key #5 can open lock #4.

Perry has a copy of key $$$k$$$, and the door is locked by lock $$$L$$$. Output "GOOD LUCK AGENT P" if Perry can open the lock. Otherwise, output "CURSE YOU" if he can't open the lock.

Input

Each test case contains two lines. The first line contains the integer $$$k$$$, while the second line contains the integer $$$L$$$.

Constraints

$$$1 \le k \le 5$$$

$$$1 \le L \le 5$$$

Note: In general, the constraints for each problem are guaranteed. You don't have to check them yourself; you may assume that they are always true.

Output

Output a single line containing one of the following strings:

  • "GOOD LUCK AGENT P" (without quotes) if Perry can open the lock.
  • "CURSE YOU" (without quotes) otherwise.
Examples
Input
1
4
Output
CURSE YOU
Input
2
3
Output
GOOD LUCK AGENT P
Input
3
1
Output
CURSE YOU
Input
1
2
Output
GOOD LUCK AGENT P
Input
1
5
Output
CURSE YOU