#include <bits/stdc++.h>
using namespace std;
struct IO {
  IO() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
  }
} _;
int n, m, len, k, t, a, b;
int G[20000010];
map<int, int> dp;
int mex(int a, int b) {
  for (int i = 0;; i++)
    if (i != a && i != b) return i;
}
int grundy(int idx) {
  if (idx <= 20000000) return G[idx];
  if (k % 2 == 0) {
    if (idx <= 2)
      return idx;
    else
      return 1 - (idx % 2);
  } else {
    if (idx <= 3) return idx % 2;
    if (idx & 1) return 0;
    if (dp.count(idx)) return dp[idx];
    return dp[idx] = mex(grundy(idx - 1), grundy(idx / 2));
  }
}
void solve() {
  G[0] = 0;
  G[1] = 1;
  for (int i = 2; i <= 20000000; i++) {
    if (i % 2 == 1) {
      if (G[i - 1] == 0)
        G[i] = 1;
      else
        G[i] = 0;
      continue;
    }
    if (k % 2 == 1)
      G[i] = mex(G[i - 1], G[i >> 1]);
    else
      G[i] = mex(G[i - 1], 0);
  }
}
int main() {
  cin >> n >> k;
  solve();
  int ans = 0;
  for (int i = 0; i < n; i++) cin >> a, ans ^= grundy(a);
  if (ans == 0)
    cout << "Nicky\n";
  else
    cout << "Kevin\n";
  return 0;
}
