#include <bits/stdc++.h>
using namespace std;
const int maxn = 500;
int N = 200;
bool vis[maxn];
int sg[maxn];
void init() {
  sg[0] = 0;
  for (int i = 1; i <= N; i++) {
    memset(vis, false, sizeof(vis));
    vis[sg[i - 1]] = true;
    if (i % 2 == 0) vis[sg[i / 2]] = true;
    for (int j = 0;; j++)
      if (!vis[j]) {
        sg[i] = j;
        break;
      }
  }
}
int k;
int SG(int x) {
  if (!(k & 1)) {
    if (x <= 2) return x;
    return (x & 1) ^ 1;
  }
  if (x <= 3) return x & 1;
  if (x == 4) return 2;
  if (x & 1) return 0;
  if (SG(x >> 1) == 1) return 2;
  return 1;
}
int tmp;
int main() {
  int n;
  while (scanf("%d%d", &n, &k) != EOF) {
    int ans = 0;
    for (int i = 1; i <= n; i++) scanf("%d", &tmp), ans ^= SG(tmp);
    if (ans == 0)
      puts("Nicky");
    else
      puts("Kevin");
  }
}
