#include <bits/stdc++.h>
using namespace std;
template <class T, class L>
bool smax(T& x, L y) {
  return x < y ? (x = y, 1) : 0;
}
template <class T, class L>
bool smin(T& x, L y) {
  return x > y ? (x = y, 1) : 0;
}
const int maxs = 5e6 + 17;
int n, k, save[] = {0, 1, 0, 1};
int get(int x) {
  if (x < 4) return save[x];
  if (x & 1) return 0;
  int tmp[2], sz, ans = 0;
  tmp[0] = get(x - 1);
  tmp[1] = get(x / 2);
  sort(tmp, tmp + 2);
  sz = unique(tmp, tmp + 2) - tmp;
  for (int i = 0; i < sz; i++)
    if (ans == tmp[i]) ans++;
  return ans;
}
int main() {
  ios::sync_with_stdio(0), cin.tie();
  cin >> n >> k, k = k & 1;
  int ans = 0;
  if (!k)
    for (int x; n--;) {
      cin >> x;
      if (x == 1)
        ans ^= 1;
      else if (x == 2)
        ans ^= 3;
      else
        ans ^= x % 2 == 0;
    }
  else
    for (int x; n--;) cin >> x, ans ^= get(x);
  cout << (ans ? "Kevin" : "Nicky") << '\n';
  return 0;
}
