#include <bits/stdc++.h>
using namespace std;
template <typename T>
T nextInt() {
  T x = 0, p = 1;
  char ch;
  do {
    ch = getchar();
  } while (ch <= ' ');
  if (ch == '-') {
    p = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + (ch - '0');
    ch = getchar();
  }
  return x * p;
}
const int maxN = (int)5e3 + 10;
const int INF = (int)1e9;
const int mod = (int)1e9 + 7;
const long long LLINF = (long long)1e18 + 5;
int g[maxN][maxN];
int solve(int n, int k) {
  if (g[n][k] != -1) return g[n][k];
  if (n == 0) return 0;
  vector<int> have(n + 1);
  have[solve(n - 1, k)] = true;
  if (n % 2 == 0) {
    if (k % 2 == 1) {
      have[solve(n / 2, k)] = true;
    } else {
      have[0] = true;
    }
  }
  for (int i = 0; i < n + 1; i++) {
    if (!have[i]) return g[n][k] = i;
  }
}
int fast(int n, int k) {
  if (k % 2 == 0) {
    if (n < 3) return n;
    return 1 - n % 2;
  }
  if (n % 2 == 1) {
    return n <= 3;
  }
  if (n == 2) return 0;
  if (n == 4) return 2;
  if (fast(n / 2, k) == 1) return 2;
  return 1;
}
int main() {
  memset(g, -1, sizeof g);
  int c = 0;
  int n, k;
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    c ^= fast(x, k);
  }
  cout << (c == 0 ? "Nicky" : "Kevin") << '\n';
  return 0;
}
