#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T BM(T p, T e, T M) {
  long long int ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T MDINV(T a, T M) {
  return BM(a, M - 2, M);
}
template <class T>
inline T PW(T p, T e) {
  long long int ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p);
    p = (p * p);
  }
  return (T)ret;
}
template <class T>
string NTS(T Number) {
  stringstream ss;
  ss << Number;
  return ss.str();
}
template <class T>
T stringtonumber(const string &Text) {
  istringstream ss(Text);
  T result;
  return ss >> result ? result : 0;
}
template <class T>
bool ISLEFT(T a, T b, T c) {
  if (((a.first - b.first) * (b.second - c.second) -
       (b.first - c.first) * (a.second - b.second)) < 0.0)
    return 1;
  else
    return 0;
}
template <typename T>
T in() {
  char ch;
  T n = 0;
  bool ng = false;
  while (1) {
    ch = getchar();
    if (ch == '-') {
      ng = true;
      ch = getchar();
      break;
    }
    if (ch >= '0' && ch <= '9') break;
  }
  while (1) {
    n = n * 10 + (ch - '0');
    ch = getchar();
    if (ch < '0' || ch > '9') break;
  }
  return (ng ? -n : n);
}
long long int m;
map<long long int, long long int> mp;
long long int grandy(long long int in) {
  if (in == 1) return 1;
  if (in == 0) return 0;
  if (mp.find(in) != mp.end()) return mp[in];
  if (in % 2 == 0) {
    long long int x = grandy(in - 1);
    long long int y = grandy(in / 2);
    if (m % 2 == 0)
      y = 0;
    else
      y = y;
    if ((x == 0 || y == 0)) {
      if (x == 1 || y == 1) {
        return mp[in] = 2;
      } else
        return mp[in] = 1;
    } else
      return mp[in] = 0;
  } else {
    if (in > 3) return mp[in] = 0;
    long long int x = grandy(in - 1);
    if (x == 0)
      return mp[in] = 1;
    else
      return mp[in] = 0;
  }
}
int main() {
  long long int n;
  scanf("%lld%lld", &n, &m);
  long long int res = 0;
  for (long long int i = 1; i <= n; i++) {
    long long int x;
    scanf("%lld", &x);
    res ^= grandy(x);
  }
  if (res == 0)
    printf("Nicky");
  else
    printf("Kevin");
  return 0;
}
