#include <bits/stdc++.h>
const long long N = 1000006;
using namespace std;
const long long MOD = 1000000007LL;
template <typename T>
T gcd(T a, T b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
template <typename T>
T power(T x, T y, long long m = MOD) {
  T ans = 1;
  while (y > 0) {
    if (y & 1LL) ans = (ans * x) % m;
    y >>= 1LL;
    x = (x * x) % m;
  }
  return ans % m;
}
long long n, k;
long long g[N], vis[N];
long long calc(long long x) {
  if (vis[x]) return g[x];
  vis[x] = 1;
  set<long long> s;
  if (x % 2 == 1) {
    s.insert(calc(x - 1));
  } else {
    s.insert(calc(x - 1));
    if (k % 2 == 0)
      s.insert(0);
    else
      s.insert(calc(x / 2));
  }
  for (long long i = 0;; i++) {
    if (s.find(i) == s.end()) {
      return g[x] = i;
    }
  }
}
long long nc(long long x) {
  if (x <= 20) return g[x];
  if (x % 2 == 1) return 0;
  set<long long> s;
  long long val = nc(x / 2);
  if (val == 1)
    return 2;
  else
    return 1;
}
long long get(long long x) {
  if (k % 2 == 1) {
    if (x <= 20) return g[x];
    return nc(x);
  } else {
    if (x <= 20) return g[x];
    if (x % 2 == 1) return 0;
    return 1;
  }
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k;
  g[0] = 0;
  vis[0] = 1;
  for (long long(i) = (1); i < (100); i++) {
    g[i] = calc(i);
  }
  long long val = 0;
  for (long long(i) = (0); i < (n); i++) {
    long long x;
    cin >> x;
    val ^= get(x);
  }
  if (val != 0)
    cout << "Kevin";
  else
    cout << "Nicky";
}
