#include <bits/stdc++.h>
using namespace std;
int N, K;
int A[1000010];
int grundy(int n) {
  if (n == 0) return 0;
  if (n == 1) return 1;
  if (K % 2 == 0) {
    if (n == 2)
      return 2;
    else if (n % 2 == 0)
      return 1;
    else
      return 0;
  } else {
    if (n == 2) return 0;
    if (n == 3) return 1;
    if (n == 4) return 2;
    if (n % 2 == 1) return 0;
    int k = n;
    while (k > 4 && k % 2 == 0) k /= 2;
    int x = grundy(k);
    for (k *= 2;; k *= 2) {
      for (int y = 1;; ++y) {
        if (y != x) {
          x = y;
          break;
        }
      }
      if (k == n) break;
    }
    return x;
  }
}
void check() {
  const int A = 1000;
  vector<int> G(A);
  for (int a = 0; a < (int)(A); a++) {
    if (a == 0) continue;
    set<int> s;
    s.insert(G[a - 1]);
    if (a % 2 == 0) s.insert(K % 2 == 0 ? 0 : G[a / 2]);
    for (int x = 0;; ++x) {
      if (s.count(x) == 0) {
        G[a] = x;
        break;
      }
    }
    if (G[a] != grundy(a)) {
      printf("K=%2d, %2d: %2d %2d\n", K, a, G[a], grundy(a));
    }
    assert(G[a] == grundy(a));
  }
}
int main() {
  while (2 == scanf("%d%d", &N, &K)) {
    for (int i = 0; i < (int)(N); i++) scanf("%d", &A[i]);
    int x = 0;
    for (int i = 0; i < (int)(N); i++) x ^= grundy(A[i]);
    puts(x ? "Kevin" : "Nicky");
  }
}
