#include <bits/stdc++.h>
using namespace std;
const int MAXN = (1 << 20);
int n, k;
int a[MAXN];
void read() {
  cin >> n >> k;
  k %= 2;
  for (int i = 0; i < n; i++) cin >> a[i];
}
map<int, int> sg;
int rec(int p) {
  if (p == 0) return 0;
  if (sg.count(p)) return sg[p];
  if (p % 2 == 1) return 0;
  set<int> s;
  s.insert(rec(p - 1));
  if (p % 2 == 0) s.insert(k * rec(p / 2));
  sg[p] = 0;
  while (s.find(sg[p]) != s.end()) sg[p]++;
  return sg[p];
}
void solve() {
  if (k == 1) {
    sg[0] = 0;
    sg[1] = 1;
    sg[2] = 0;
    sg[3] = 1;
    sg[4] = 2;
  } else {
    sg[0] = 0;
    sg[1] = 1;
    sg[2] = 2;
  }
  int ans = 0;
  for (int i = 0; i < n; i++) ans ^= rec(a[i]);
  if (ans != 0)
    cout << "Kevin" << '\n';
  else
    cout << "Nicky" << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  read();
  solve();
  return 0;
}
