#include <bits/stdc++.h>
long long mpow(long long a, long long n, long long mod) {
  long long ret = 1;
  long long b = a;
  while (n) {
    if (n & 1) ret = (ret * b) % mod;
    b = (b * b) % mod;
    n >>= 1;
  }
  return (long long)ret;
}
using namespace std;
using namespace std;
int a[(int)1e6 + 5];
int send(int val) {
  if (val == 0) return 0;
  if (val == 1) return 1;
  if (val == 2) return 0;
  if (val == 3) return 1;
  if (val == 4) return 2;
  if (val % 2 == 0)
    return (send(val / 2) == 1 ? 2 : 1);
  else
    return 0;
}
int main() {
  long long n, k, i, j;
  cin >> n >> k;
  for (j = 0; j < n; j++) {
    cin >> a[j];
  }
  if (k % 2 == 0) {
    int x = 0;
    for (j = 0; j < n; j++) {
      if (a[j] % 2 == 0 && a[j] != 1 && a[j] != 2)
        x = x ^ 1;
      else if (a[j] == 2)
        x = x ^ 2;
      else if (a[j] == 1)
        x = x ^ 1;
    }
    if (x)
      cout << "Kevin";
    else
      cout << "Nicky";
  } else {
    int x = 0;
    for (j = 0; j < n; j++) {
      x = x ^ send(a[j]);
    }
    if (x)
      cout << "Kevin";
    else
      cout << "Nicky";
  }
  return 0;
}
