#include <bits/stdc++.h>
const long INF = 1e9 + 9;
const long MOD = 1e9 + 7;
const long PRIME = 200003;
const long long L_INF = 1e18 + 1;
const double EPS = 10e-9;
using namespace std;
long n, k, ksor;
long comp[5], stones[100005];
long find_nimber(long v) {
  if (v < 5) return comp[v];
  if (v & 1) return 0;
  if (find_nimber(v / 2) == 1)
    return 2;
  else
    return 1;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k;
  for (long i = 0; i < n; i++) cin >> stones[i];
  if (k & 1) {
    comp[1] = 1;
    comp[2] = 0;
    comp[3] = 1;
    comp[4] = 2;
    for (long i = 0; i < n; i++) ksor ^= find_nimber(stones[i]);
  } else {
    for (long i = 0; i < n; i++) {
      if (stones[i] == 1)
        ksor ^= 1;
      else if (stones[i] == 2)
        ksor ^= 2;
      else if (!(stones[i] & 1))
        ksor ^= 1;
    }
  }
  cout << (ksor == 0 ? "Nicky\n" : "Kevin\n");
}
