Kevin 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 ai cows. During each player's turn, that player calls upon the power of Sunlight, and uses it to either:

  1. Remove a single cow from a chosen non-empty pile. 
  2. 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 a1, a2, ..., an, 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 ≤ 109).

The second line contains n integers, a1, a2, ... an (1 ≤ ai ≤ 109) 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.
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Set;
import java.io.IOException;
import java.util.HashMap;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.StringTokenizer;
import java.util.Map;
import java.io.Writer;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Agostinho Junior (junior94)
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		OutputWriter out = new OutputWriter(outputStream);
		TaskE solver = new TaskE();
		solver.solve(1, in, out);
		out.close();
	}

	static class TaskE {
		private Map<Integer, Integer> memo = new HashMap<>();

		public void solve(int testNumber, InputReader in, OutputWriter out) {
			int n = in.readInt();
			int k = in.readInt() % 2;

			int res = 0;
			for (int i = 0; i < n; i++) {
				int a = in.readInt();
				res ^= nimber(a, k);
			}

			out.println(res == 0 ? "Nicky" : "Kevin");
		}

		private int nimber(int n, int k) {
			if (k == 0) {
				return n <= 2 ? n : (n & 1) ^ 1;
			}

			if (n == 0) {
				return 0;
			}

			if (n == 2 || (n % 2 == 1 && n >= 5)) {
				return 0;
			}

			if (n % 2 == 0) {
				if ((n & (n - 1)) == 0) {
					if (memo.containsKey(n)) {
						return memo.get(n);
					}
					int value = getEven(n, k);
					memo.put(n, value);
					return value;
				}
				return getEven(n, k);
			}

			if (nimber(n - 1, k) == 0) {
				return 1;
			}

			return 0;
		}

		private int getEven(int n, int k) {
			Set<Integer> set = new HashSet<>();
			set.add(nimber(n - 1, k));
			if (k == 0) {
				set.add(0);
			} else {
				set.add(nimber(n / 2, k));
			}
			int value = 0;
			while (set.contains(value)) {
				value++;
			}
			return value;
		}

	}

	static class OutputWriter {
		private PrintWriter output;

		public OutputWriter() {
			this(System.out);
		}

		public OutputWriter(OutputStream out) {
			output = new PrintWriter(out);
		}

		public OutputWriter(Writer writer) {
			output = new PrintWriter(writer);
		}

		public void println(Object o) {
			output.println(o);
		}

		public void close() {
			output.close();
		}

	}

	static class InputReader {
		private BufferedReader input;
		private StringTokenizer line = new StringTokenizer("");

		public InputReader() {
			this(System.in);
		}

		public InputReader(InputStream in) {
			input = new BufferedReader(new InputStreamReader(in));
		}

		public InputReader(String s) {
			try {
				input = new BufferedReader(new FileReader(s));
			} catch (IOException io) {
				io.printStackTrace();
				System.exit(0);
			}
		}

		public void fill() {
			try {
				if (!line.hasMoreTokens()) {
					line = new StringTokenizer(input.readLine());
				}
			} catch (IOException io) {
				io.printStackTrace();
				System.exit(0);
			}
		}

		public int readInt() {
			fill();
			return Integer.parseInt(line.nextToken());
		}

	}
}

