#include <bits/stdc++.h>
using namespace std;
const long double PI = acos(-1.0);
long long a[100005];
long long grundy(long long num) {
  long long ans[] = {0, 1, 0, 1, 2};
  if (num <= 4) {
    return ans[num];
  }
  if (num % 2 == 1) {
    return 0;
  } else {
    if (grundy(num / 2) == 1)
      return 2;
    else
      return 1;
  }
}
void solve() {
  long long n, k;
  cin >> n >> k;
  for (long long i = 1; i < n + 1; ++i) cin >> a[i];
  if (k % 2 == 0) {
    long long x = 0;
    for (long long i = 1; i < n + 1; ++i) {
      if (a[i] <= 2)
        x ^= a[i];
      else
        x ^= ((a[i] + 1) % 2);
    }
    if (x == 0) {
      cout << "Nicky" << '\n';
    } else
      cout << "Kevin" << '\n';
  } else {
    long long x = 0;
    for (long long i = 1; i < n + 1; ++i) {
      x ^= grundy(a[i]);
    }
    if (x == 0) {
      cout << "Nicky" << '\n';
    } else
      cout << "Kevin" << '\n';
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
