#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 1e2;
void fin() {}
const bool flag = 0;
int k;
map<int, int> g;
int grundy(int first) {
  if (first == 0) {
    return 0;
  }
  if (g.count(first)) {
    return g[first];
  }
  vector<bool> used(4);
  int gi = 0;
  if (first & 1 || first < 6) {
    gi = grundy(first - 1);
  }
  used[gi] = 1;
  if (first % 2 == 0) {
    if (k % 2 == 0) {
      used[0] = 1;
    }
    if (k & 1 && first - 1 != first / 2) {
      used[grundy(first / 2)] = 1;
    }
  }
  int mex = 0;
  for (; used[mex]; mex++)
    ;
  return g[first] = mex;
}
void ma1n() {
  int n;
  cin >> n >> k;
  vector<int> a(n);
  int G = 0;
  for (int& first : a) {
    cin >> first;
    G ^= grundy(first);
  }
  cout << (G ? "Kevin" : "Nicky");
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(nullptr), fin();
  int ts = 1;
  if (flag) {
    cin >> ts;
  }
  while (ts--) {
    ma1n();
  }
  return 0;
}
