#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, m, a[N], ans;
inline long long getint() {
  long long x = 0;
  char c = getchar();
  bool flag = false;
  while ((c != '-') && ((c < '0') || (c > '9'))) c = getchar();
  if (c == '-') flag = true, c = getchar();
  while ((c >= '0') && (c <= '9'))
    x = x * 10 + (long long)(c - '0'), c = getchar();
  if (flag)
    return -x;
  else
    return x;
}
void init() {
  n = getint();
  m = getint();
  for (int i = 1; i <= n; i++) a[i] = getint();
}
inline int sg(int x) {
  if (x == 0) return 0;
  if (m % 2 == 0) {
    if (x == 1) return 1;
    if (x == 2) return 2;
    return 1 - x % 2;
  }
  if (x == 1) return 1;
  if (x == 2) return 0;
  if (x == 3) return 1;
  if (x == 4) return 2;
  if (x % 2 == 1) return 0;
  int mex = sg(x / 2);
  if (mex == 0) return 1;
  if (mex == 1) return 2;
  return 1;
}
void solve() {
  ans = 0;
  for (int i = 1; i <= n; i++) ans ^= sg(a[i]);
  if (ans == 0)
    printf("Nicky\n");
  else
    printf("Kevin\n");
}
int main() {
  init();
  solve();
  return 0;
}
