Please subscribe to the official Codeforces channel in Telegram via the link https://t.me/codeforces_official.
×

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
C. Lieges of Legendre

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputKevin and Nicky Sun have invented a new game called Lieges of Legendre. In this game, two players take turns modifying the game state with Kevin moving first. Initially, the game is set up so that there are *n* piles of cows, with the *i*-th pile containing *a*_{i} cows. During each player's turn, that player calls upon the power of Sunlight, and uses it to either:

- Remove a single cow from a chosen non-empty pile.
- Choose a pile of cows with even size 2·
*x*(*x*> 0), and replace it with*k*piles of*x*cows each.

The player who removes the last cow wins. Given *n*, *k*, and a sequence *a*_{1}, *a*_{2}, ..., *a*_{n}, help Kevin and Nicky find the winner, given that both sides play in optimal way.

Input

The first line of the input contains two space-separated integers *n* and *k* (1 ≤ *n* ≤ 100 000, 1 ≤ *k* ≤ 10^{9}).

The second line contains *n* integers, *a*_{1}, *a*_{2}, ... *a*_{n} (1 ≤ *a*_{i} ≤ 10^{9}) describing the initial state of the game.

Output

Output the name of the winning player, either "Kevin" or "Nicky" (without quotes).

Examples

Input

2 1

3 4

Output

Kevin

Input

1 2

3

Output

Nicky

Note

In the second sample, Nicky can win in the following way: Kevin moves first and is forced to remove a cow, so the pile contains two cows after his move. Next, Nicky replaces this pile of size 2 with two piles of size 1. So the game state is now two piles of size 1. Kevin then removes one of the remaining cows and Nicky wins by removing the other.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Sep/23/2021 12:59:43 (j2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|