#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
int n, k;
int g(int x) {
  if (k % 2 == 0) {
    if (x == 0) return 0;
    if (x == 1) return 1;
    if (x == 2) return 2;
    if (x % 2 == 1)
      return 0;
    else
      return 1;
  } else {
    if (x == 0) return 0;
    if (x == 1) return 1;
    if (x == 2) return 0;
    if (x == 3) return 1;
    int n2 = 0;
    while (x % 2 == 0) x /= 2, ++n2;
    if (n2 == 0) return 0;
    if (x == 3) return n2 % 2 == 0 ? 1 : 2;
    return n2 % 2 == 0 ? 2 : 1;
  }
}
void run() {
  scanf("%d%d", &n, &k);
  int ret = 0;
  for (int i = (0); i < (n); ++i) {
    int x;
    scanf("%d", &x);
    ret ^= g(x);
  }
  printf("%s\n", ret == 0 ? "Nicky" : "Kevin");
}
int main() {
  run();
  return 0;
}
