#include <bits/stdc++.h>
using namespace std;
int f[11], x, k, n;
int work(int x) {
  if (!(1 & k)) {
    if (x <= 4)
      return f[x];
    else if (1 & x)
      return 0;
    else
      return 1;
  } else {
    if (x <= 4)
      return f[x];
    else if (1 & x)
      return 0;
    else
      return work(x / 2) == 1 ? 2 : 1;
  }
}
int main() {
  int ans;
  ans = 0;
  scanf("%d %d", &n, &k);
  if (1 & k) {
    f[0] = 0;
    f[1] = 1;
    f[2] = 0;
    f[3] = 1;
    f[4] = 2;
  } else {
    f[0] = 0;
    f[1] = 1;
    f[2] = 2;
    f[3] = 0;
    f[4] = 1;
  }
  for (int i = 1; i <= n; i++) {
    scanf("%d", &x);
    ans ^= work(x);
  }
  printf("%s", ans ? "Kevin" : "Nicky");
  return 0;
}
