#include <bits/stdc++.h>
using namespace std;
const int maxn = 205;
long long n, k, t;
long long sg[maxn];
long long solve_odd(long long x) {
  if (x < 7) return sg[x];
  if (x & 1) return 0;
  int t = solve_odd(x / 2);
  return t == 1 ? 2 : 1;
}
long long solve_even(long long x) {
  if (x < 7) return sg[x];
  if (x & 1) return 0;
  return 1;
}
int main() {
  memset(sg, -1, sizeof(sg));
  sg[0] = 0;
  sg[1] = 1;
  while (scanf("%lld%lld", &n, &k) == 2) {
    long long ans = 0;
    for (int i = 0; i < n; i++) {
      scanf("%lld", &t);
      if (k & 1) {
        sg[2] = 0;
        sg[3] = 1;
        sg[4] = 2;
        sg[5] = 0;
        sg[6] = 2;
        ans ^= solve_odd(t);
      } else {
        sg[2] = 2;
        sg[3] = 0;
        sg[4] = 1;
        sg[5] = 0;
        sg[6] = 1;
        ans ^= solve_even(t);
      }
    }
    if (ans)
      puts("Kevin");
    else
      puts("Nicky");
  }
  return 0;
}
