I. Iron Fist Ketil vs King Canute
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

King Canute is attempting to expropriate Iron Fist Ketil's farm. However, Ketil is a proud man who refuses to give up his lands, not even to the king. He asks his men to prepare for the fight of their lives against King Canute's troops.

Unfortunately, Ketil's men are farmers and lack any battlefield experience. On the other hand, Canute's troops are composed of seasoned soldiers who have conquered nations. As you can imagine, the odds are heavily stacked against Ketil.

Therefore, Ketil estimates that he needs $$$K$$$ of his men to kill just one of Canute's soldiers. Given $$$N$$$, the number of Ketil's men, $$$M$$$ the number of Canute's men, and $$$K$$$, is it possible for Ketil to win the battle?

It should be noted that Ketil's men have limited stamina, so they can only engage in combat with one soldier throughout the entire battle.

Input

A single line containing $$$N$$$ - the number of Ketil's men, M - the number of Canute's men, and K - the number of Ketil's men required to kill one of Canute's men. ($$$1 \leq N,M,K \leq 10^6$$$)

Output

Print a single line containing:

'Iron fist Ketil' if Ketil can win the battle.

'King Canute' otherwise

Examples
Input
12 5 2
Output
Iron fist Ketil
Input
1 1 1
Output
Iron fist Ketil
Input
1 2 2
Output
King Canute