#include <bits/stdc++.h>
int n, k, res;
const int sg[] = {0, 1, 0, 1, 2, 0, 2, 0};
inline int SG(int x) {
  if (x < 8) return sg[x];
  if (x & 1) return 0;
  return SG(x / 2) == 1 ? 2 : 1;
}
inline int Sg(int x) {
  if (x == 1) return 1;
  if (x == 2) return 2;
  return !(x & 1);
}
int main() {
  scanf("%d%d", &n, &k);
  if (k & 1)
    for (int x; n--;) scanf("%d", &x), res ^= SG(x);
  else
    for (int x; n--;) scanf("%d", &x), res ^= Sg(x);
  puts(res ? "Kevin" : "Nicky");
}
