#include <bits/stdc++.h>
using namespace std;
int memo[21] = {0, 1, 0, 1, 2, 0, 2, 0, 1, 0, 1, 0, 1, 0, 1, 0, 2, 0, 1, 0, 2};
int a[(int)1e6];
int g[(int)1e6];
int find_g(int a, int K) {
  if (K % 2 == 0) {
    if (a == 1) return 1;
    if (a == 2) return 2;
    return (a % 2) ^ 1;
  } else {
    if (a <= 5) return memo[a];
    if (a % 2 == 1) return 0;
    return (find_g(a / 2, K) == 1 ? 2 : 1);
  }
}
int main() {
  int t, n, m, i, j, k;
  cin >> n >> k;
  for (i = 0; i < n; i++) scanf("%d", a + i);
  for (i = 0; i < n; i++) {
    g[i] = find_g(a[i], k);
  }
  m = 0;
  for (int i = 0; i < n; ++i) m ^= g[i];
  if (m)
    cout << "Kevin";
  else
    cout << "Nicky";
  return 0;
}
