#include <bits/stdc++.h>
using namespace std;
const int N = 205;
int dp[N][2];
int grundy(int a, int k) {
  if (!a) return 0;
  int &ret = dp[a][k & 1];
  if (ret != -1) return ret;
  set<int> second;
  if (a & 1)
    second.insert(grundy(a - 1, k));
  else {
    second.insert(grundy(a - 1, k));
    if (k & 1)
      second.insert(grundy(a / 2, k));
    else
      second.insert(0);
  }
  for (int i = (0); i <= (int)(1000000000ll); ++i)
    if (!second.count(i)) return ret = i;
  return ret;
}
int g[] = {0, 1, 0, 1};
int solve(int a, int k) {
  if (!(k & 1)) {
    if (a < 3) return a;
    return !(a & 1);
  }
  if (a < 4) return g[a];
  if (a & 1) return 0;
  bool flip = true;
  while (!(a & 1) && a > 2) a /= 2, flip ^= 1;
  int ret = 0;
  if (a > 3)
    ret = 1;
  else
    ret = 2;
  if (flip) {
    if (ret == 1)
      ret = 2;
    else
      ret = 1;
  }
  return ret;
}
int main() {
  memset(dp, -1, sizeof dp);
  int n, k, ans = 0;
  scanf("%d%d", &n, &k);
  for (int i = (1); i <= (int)(n); ++i) {
    int a;
    scanf("%d", &a);
    ans ^= solve(a, k);
  }
  if (ans)
    printf("Kevin\n");
  else
    printf("Nicky\n");
  return 0;
}
