#include <bits/stdc++.h>
using namespace std;
int f[10] = {0, 1, 0, 1, 2, 0};
int n, k;
int a[1000001];
int g(int n) {
  if (n <= 5) return f[n];
  if (n & 1) return 0;
  int r = 0;
  while (n % 2 == 0) ++r, n /= 2;
  if (n == 1 && r % 2 == 0) return 2;
  if (n == 3 && r % 2 == 1) return 2;
  if ((n != 1 && n != 3) && r % 2 == 0) return 2;
  return 1;
}
int main() {
  scanf("%d %d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  if (k & 1) {
    int ans = 0;
    for (int i = 1; i <= n; i++) ans ^= g(a[i]);
    if (ans == 0)
      printf("Nicky\n");
    else
      printf("Kevin\n");
  } else {
    int ans = 0;
    for (int i = 1; i <= n; i++) {
      int tmp = a[i];
      int sg = 0;
      if (tmp <= 2)
        sg = tmp;
      else
        sg = (tmp & 1) ^ 1;
      ans ^= sg;
    }
    if (ans == 0)
      printf("Nicky\n");
    else
      printf("Kevin\n");
  }
  return 0;
}
