#include <bits/stdc++.h>
const int N = 100005;
int a[N], sg[10], n, k, ans;
int solve(int x) {
  if (x <= 5) return sg[x];
  if (x & 1) return 0;
  if (solve(x / 2) == 1) return 2;
  return 1;
}
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  if (k % 2 == 0) {
    for (int i = 1; i <= n; i++) {
      if (a[i] == 1)
        ans ^= 1;
      else if (a[i] == 2)
        ans ^= 2;
      else
        ans ^= (a[i] % 2 ? 0 : 1);
    }
    puts(ans ? "Kevin" : "Nicky");
  } else {
    sg[1] = 1, sg[3] = 1, sg[4] = 2;
    for (int i = 1; i <= n; i++) ans = ans ^ (solve(a[i]));
    puts(ans ? "Kevin" : "Nicky");
  }
}
