#include <bits/stdc++.h>
using namespace std;
long long int n, k;
int sg[10] = {0, 1, 0, 1, 2};
int grundy(long long int x) {
  if (x <= 4) return sg[x];
  if (x % 2 == 1) return 0;
  int vis[3];
  memset(vis, 0, sizeof(vis));
  vis[0] = 1;
  vis[grundy(x / 2)] = 1;
  int g = 0;
  while (vis[g]) g++;
  return g;
}
int main() {
  while (scanf("%I64d%I64d", &n, &k) != EOF) {
    int res = 0;
    long long int ta;
    if (k % 2 == 0) {
      for (int i = 0; i < n; i++) {
        scanf("%I64d", &ta);
        if (ta <= 2)
          res ^= ta;
        else if (ta % 2 == 0) {
          res ^= 1;
        }
      }
    } else {
      for (int i = 0; i < n; i++) {
        scanf("%I64d", &ta);
        res ^= grundy(ta);
      }
    }
    if (res)
      printf("Kevin\n");
    else
      printf("Nicky\n");
  }
  return 0;
}
