#include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
vector<long long> X;
long long K;
long long g(long long a) {
  if (a < (long long)X.size()) return X[a];
  if (a % 2 == 1) return 0;
  long long g2;
  if (K % 2 == 1) {
    g2 = g(a / 2);
  } else {
    g2 = 0;
  }
  if (g2 == 0 || g2 == 2) return 1;
  return 2;
}
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  long long N;
  cin >> N >> K;
  vector<long long> A(N);
  long long res = 0;
  for (long long i = 0; i < N; i++) {
    cin >> A[i];
  }
  X.resize(1000);
  X[0] = 0;
  for (long long i = 1; i < X.size(); i++) {
    set<long long> st;
    st.insert(X[i - 1]);
    if (K % 2 == 1) {
      if (i % 2 == 0) st.insert(X[i / 2]);
    } else {
      if (i % 2 == 0) st.insert(0);
    }
    for (long long j = 0; j < 3; j++) {
      if (st.count(j) == 0) {
        X[i] = j;
        break;
      }
    }
  }
  long long gr = 0;
  for (long long i = 0; i < N; i++) {
    gr ^= g(A[i]);
  }
  if (gr == 0) {
    cout << "Nicky" << endl;
  } else {
    cout << "Kevin" << endl;
  }
}
