#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
int k, n;
map<int, int> mp;
int solve(int n) {
  if (n == 0) return 0;
  if (n == 1 || n == 3) return 1;
  if (n & 1) return 0;
  if (mp.count(n)) return mp[n];
  int vis[5] = {0};
  vis[solve(n - 1)] = 1;
  if (n % 2 == 0) {
    int x = n / 2;
    if (k & 1)
      vis[solve(x)] = 1;
    else
      vis[0] = 1;
  }
  int cur = 0;
  while (vis[cur]) cur++;
  return mp[n] = cur;
}
int main() {
  int sg = 0;
  cin >> n >> k;
  if (k % 2 == 0) {
    for (int i = 1; i <= n; i++) {
      int x;
      scanf("%d", &x);
      if (x == 1)
        sg ^= 1;
      else if (x == 2)
        sg ^= 2;
      else if (x & 1)
        sg ^= 0;
      else
        sg ^= 1;
    }
  } else {
    for (int i = 1; i <= n; i++) {
      int x;
      scanf("%d", &x);
      sg ^= solve(x);
    }
  }
  if (sg)
    puts("Kevin");
  else
    puts("Nicky");
  return 0;
}
