#include <bits/stdc++.h>
using namespace std;
template <class T>
bool uax(T& a, const T& b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
bool uin(T& a, const T& b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
void solve() {
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  for (int i = 0; i < (int)(n); ++i) cin >> a[i];
  int m = 1e6;
  vector<int> g(m + 1);
  for (int i = 0; i < (int)(m + 1); ++i)
    if (i) {
      vector<int> gg = {g[i - 1]};
      if (i % 2 == 0) gg.push_back(g[i / 2] * (k % 2));
      while (find((gg).begin(), (gg).end(), g[i]) != gg.end()) ++g[i];
    }
  map<int, int> mg;
  function<int(int)> getg = [&](int n) {
    if (n >= 5 && n % 2 == 1) return 0;
    if (n < m) return g[n];
    auto it = mg.find(n);
    if (it != mg.end()) return it->second;
    vector<int> gg = {getg(n - 1)};
    if (n % 2 == 0) {
      if (k % 2)
        gg.push_back(getg(n / 2));
      else
        gg.push_back(0);
    }
    int r = 0;
    while (find((gg).begin(), (gg).end(), r) != gg.end()) ++r;
    return mg[n] = r;
  };
  int s = 0;
  for (int x : a) s ^= getg(x);
  cout << (s != 0 ? "Kevin" : "Nicky") << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout << fixed;
  cout.precision(15);
  cerr << fixed;
  cerr.precision(15);
  solve();
  return 0;
}
