#include <bits/stdc++.h>
using namespace std;
int n, k;
int a[100100];
int sg(int a) {
  if (k % 2) {
    int first[] = {0, 1, 0, 1, 2, 0, 2, 0, 1};
    if (a <= 8)
      return first[a];
    else if (a % 2)
      return 0;
    else if ((a / 2) % 2)
      return 1;
    else
      return 3 - sg(a / 2);
  } else {
    if (a == 1)
      return 1;
    else if (a == 2)
      return 2;
    else if (a % 2)
      return 0;
    else
      return 1;
  }
}
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  int res = 0;
  for (int i = 1; i <= n; i++) {
    res ^= sg(a[i]);
  }
  if (res == 0)
    cout << "Nicky" << endl;
  else
    cout << "Kevin" << endl;
  return 0;
}
