#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void umax(T &x, T y) {
  x = x ^ ((x ^ y) & -(x < y));
}
template <class T>
inline void umin(T &x, T y) {
  x = y ^ ((x ^ y) & -(x < y));
}
const int N = 2e5, pre[] = {0, 1, 0, 1, 2};
int n, k, ans;
int grundy(int x) {
  if (k % 2 == 0)
    if (x <= 2)
      return x;
    else
      return (x % 2) ^ 1;
  else if (x < 5)
    return pre[x];
  else if (x % 2 == 1)
    return 0;
  else
    return (grundy(x / 2) == 1 ? 2 : 1);
}
int main() {
  cin >> n >> k;
  for (int i = 0, a; i < n; i++) cin >> a, ans = ans ^ grundy(a);
  if (ans)
    cout << "Kevin\n";
  else
    cout << "Nicky\n";
  return !1;
}
