#include <bits/stdc++.h>
using namespace std;
map<long long, int> m;
int K;
int solve(int x) {
  if (m.count(x)) return m[x];
  int ans = 0;
  if (x == 0) return 0;
  if (x % 2) {
    ans = (solve(x - 1) ? 0 : 1);
  } else {
    int rm = x < 10 ? solve(x - 1) : 0;
    int sp;
    if (K % 2)
      sp = solve(x / 2);
    else
      sp = 0;
    if (rm != 0 && sp != 0) {
      ans = 0;
    } else if (rm != 1 && sp != 1) {
      ans = 1;
    } else {
      ans = 2;
    }
  }
  return m[x] = ans;
}
int solve2(int n) {
  if (K % 2 == 0) {
    if (n < 3) return n;
    if (n % 2) return 0;
    return 1;
  } else {
    if (n < 2) return n;
    if (n == 2) return 0;
    if (n == 3) return 1;
    if (n % 2) return 0;
    return 0;
  }
}
int main() {
  int n;
  cin >> n >> K;
  int res = 0;
  for (int i = 0; i < n; i++) {
    int t;
    cin >> t;
    res ^= solve(t);
  }
  if (res == 0) {
    cout << "Nicky" << endl;
  } else {
    cout << "Kevin" << endl;
  }
  return 0;
}
