#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  long long r;
  while (b != 0) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
const int mod = (int)1e9 + 7;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = 2 * acos(0);
const int M = 50;
const int N = 1e6 + 7;
int F[N];
int g(int n, int t) { return F[n]; }
int f(int n, int t) {
  if (t & 1) {
    if (n < N) return F[n];
    if (n & 1) return 0;
    int u = f(n / 2, t);
    if (u == 1)
      return 2;
    else
      return 1;
  } else {
    if (n < 15) return F[n];
    if (!(n & 1))
      return 1;
    else
      return 0;
  }
}
int n, k;
void solve() {
  cin >> n >> k;
  F[0] = 0;
  for (int i = 1; i < N; i++) {
    if (i & 1) {
      if (F[i - 1] == 0)
        F[i] = 1;
      else
        F[i] = 0;
    } else {
      for (int t = 0; t < 3; t++) {
        if (k & 1) {
          if (t != F[i - 1] && t != F[i / 2]) {
            F[i] = t;
            break;
          }
        } else {
          if (t != F[i - 1] && t != 0) {
            F[i] = t;
            break;
          }
        }
      }
    }
  }
  int sumg = 0;
  for (int i = 0; i < n; i++) {
    int u;
    scanf("%d", &u);
    sumg = sumg ^ f(u, k);
  }
  if (sumg)
    puts("Kevin");
  else
    puts("Nicky");
}
int main() {
  solve();
  return 0;
}
