#include <bits/stdc++.h>
using namespace std;
const int nmax = 100010;
int n, k, a[nmax];
int grundy(int x) {
  if (x == 0 || x == 2 || x == 5) return 0;
  if (x == 1 || x == 3) return 1;
  if (x == 4) return 2;
  if (x % 2 == 1) return 0;
  bool used[3];
  used[0] = used[1] = used[2] = 0;
  used[grundy(x - 1)] = 1;
  used[grundy(x / 2)] = 1;
  if (!used[0]) return 0;
  if (!used[1]) return 1;
  if (!used[2]) return 2;
}
int main() {
  int ans = 0;
  scanf("%i %i", &n, &k);
  for (int i = 1; i <= n; ++i) {
    scanf("%i", &a[i]);
    if (k % 2 == 0) {
      if (a[i] == 1)
        ans ^= 1;
      else if (a[i] == 2)
        ans ^= 2;
      else
        ans ^= 1 - a[i] % 2;
    } else
      ans ^= grundy(a[i]);
  }
  if (ans > 0)
    printf("Kevin\n");
  else
    printf("Nicky\n");
}
