An integer $n$ is golden if $n$ can be represented as a sum of at most $k$ distinct Fibonacci numbers. Given $n, k$, determine if $n$ is golden.

Fibonacci numbers are defined by $F_1 = 1, F_2 = 1$, and $F_{n+2} = F_{n+1} + F_n$ for all integers $n \ge 1$.

Input

The first line of the input consists of a line with an two integers, $n$ and $k$.

Output

If $n$ is golden, output Golden. Otherwise, output Plain.

Constraints

For all testcases: $1 \le n \le 10^9, 1\le k \le 64$
Subtask 1 (10%): $n \le 1000, k = 1$
Subtask 2 (40%): $n \le 10^6, k \le 2$
Subtask 3 (49%): $k \le 3$
Subtask 4 (1%): No additional constraints