#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
void qread(int &x) {
  int neg = 1;
  x = 0;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') neg = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') x = 10 * x + c - '0', c = getchar();
  x *= neg;
}
const int maxn = 100005;
int n, k;
map<int, int> sg;
int solve(int x) {
  if (sg.count(x)) return sg[x];
  if (!x) return sg[x] = 0;
  if (x > 3 && x % 2 == 1) return sg[x] = 0;
  int res = 0;
  int val1 = solve(x - 1), val2 = 1e9;
  if (x % 2 == 0) {
    val2 = solve(x / 2);
    if (!k) val2 = 0;
  }
  if (val1 > val2) swap(val1, val2);
  if (res == val1) res++;
  if (res == val2) res++;
  return sg[x] = res;
}
int main() {
  scanf("%d%d", &n, &k);
  k &= 1;
  int ans = 0;
  for (int(i) = 0; (i) < n; i++) {
    int x;
    scanf("%d", &x);
    ans ^= solve(x);
  }
  puts(ans ? "Kevin" : "Nicky");
  return 0;
}
