#include <bits/stdc++.h>
using namespace std;
const int inf = ~0U >> 1;
const long long INF = ~0ULL >> 1;
template <class T>
inline void read(T &n) {
  char c;
  int flag = 1;
  for (c = getchar(); !(c >= '0' && c <= '9' || c == '-'); c = getchar())
    ;
  if (c == '-')
    flag = -1, n = 0;
  else
    n = c - '0';
  for (c = getchar(); c >= '0' && c <= '9'; c = getchar()) n = n * 10 + c - '0';
  n *= flag;
}
int K, N, ans, x, vis[10000], sg[10000];
map<int, int> f;
int calc(int x) {
  if (f.count(x)) return f[x];
  if (K % 2 == 0) {
    if (x == 1)
      return 1;
    else if (x == 2)
      return 2;
    else if (x & 1)
      return 0;
    else
      return 1;
  } else {
    if (x == 1 || x == 3) return 1;
    if (x & 1) return 0;
    int vis[5];
    memset(vis, 0, sizeof(vis));
    vis[calc(x - 1)] = true;
    if (K % 2 == 0)
      vis[0] = true;
    else
      vis[calc(x / 2)] = true;
    int r = 0;
    while (vis[r]) ++r;
    return f[x] = r;
  }
}
int main() {
  scanf("%d%d", &N, &K);
  for (int i = (1); i <= (N); ++i) scanf("%d", &x), ans ^= calc(x);
  if (!ans)
    puts("Nicky");
  else
    puts("Kevin");
  return 0;
}
