#include <bits/stdc++.h>
using namespace std;
const int N = 1000100;
const int C = 10;
const int MOD = 1e9 + 7;
int n, k, a[N], dp[N], step, used[N];
int f(int x) {
  if (x <= C) return dp[x];
  int res;
  if (k % 2 == 0) {
    if (x % 2 == 0)
      res = 1;
    else
      res = 0;
  } else {
    if (x % 2 == 0) {
      int val = f(x / 2);
      if (val == 0)
        res = 1;
      else if (val == 1)
        res = 2;
      else
        res = 1;
    } else
      res = 0;
  }
  return res;
}
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  dp[0] = 0;
  step = 0;
  for (int i = 1; i <= C; i++) {
    step++;
    used[dp[i - 1]] = step;
    if (i % 2 == 0) {
      if (k % 2 == 0)
        used[0] = step;
      else
        used[dp[i / 2]] = step;
    }
    dp[i] = -1;
    for (int j = 0; j <= 2; j++)
      if (used[j] != step) {
        dp[i] = j;
        break;
      }
  }
  int ans = 0;
  for (int i = 1; i <= n; i++) ans ^= f(a[i]);
  if (ans != 0)
    cout << "Kevin";
  else
    cout << "Nicky";
  return 0;
}
