#include <bits/stdc++.h>
using namespace std;
int n, k;
int a;
int f[100007];
int dfs(int x) {
  if (x < 6) return f[x];
  if (x & 1)
    return 0;
  else
    return dfs(x / 2) == 1 ? 2 : 1;
}
int main() {
  while (~scanf("%d%d", &n, &k)) {
    int sum = 0;
    for (int i = 0; i < n; i++) {
      scanf("%d", &a);
      if (k & 1) {
        f[0] = f[2] = f[5] = 0;
        f[1] = f[3] = 1;
        f[4] = 2;
        if (a < 6)
          sum ^= f[a];
        else
          sum ^= a & 1 ? 0 : dfs(a);
      } else {
        f[0] = f[3] = 0;
        f[1] = f[4] = 1;
        f[2] = 2;
        if (a < 5)
          sum ^= f[a];
        else
          sum ^= a & 1 ? 0 : 1;
      }
    }
    if (sum)
      puts("Kevin");
    else
      puts("Nicky");
  }
}
