#include <bits/stdc++.h>
using namespace std;
int n, k;
int dp[100005];
int f(int pile) {
  if (pile == 0) return 0;
  if (dp[pile] != -1) return dp[pile];
  set<int> S;
  int ret = 0;
  ret ^= f(pile - 1);
  S.insert(ret);
  if (pile % 2 == 0) {
    int ret = 0;
    if (k % 2) {
      ret ^= f(pile / 2);
      S.insert(ret);
    } else
      S.insert(0);
  }
  int aa = 0;
  for (__typeof((S).begin()) i = (S).begin(); i != (S).end(); i++) {
    if (*i != aa) break;
    aa++;
  }
  return dp[pile] = aa;
}
int main() {
  cin >> n >> k;
  int ans = 0;
  memset(dp, -1, sizeof(dp));
  for (int i = 0; i < n; i++) {
    int a;
    cin >> a;
    if (k % 2 == 0) {
      if (a == 1 || a == 2)
        ans ^= a;
      else
        ans ^= !(a % 2);
    } else {
      if (a % 2) {
        if (a == 1 || a == 3) ans ^= 1;
      } else {
        if (a == 2) continue;
        if (a == 6)
          ans ^= 2;
        else if ((a / 2) % 2)
          ans ^= 1;
        else {
          int cnt = 0;
          while (a % 2 == 0) {
            cnt++;
            a /= 2;
          }
          if (a == 1) {
            if (cnt % 2)
              ans ^= 1;
            else
              ans ^= 2;
          } else if (a == 3) {
            if (cnt % 2)
              ans ^= 2;
            else
              ans ^= 1;
          } else {
            if (cnt % 2)
              ans ^= 1;
            else
              ans ^= 2;
          }
        }
      }
    }
  }
  if (ans)
    cout << "Kevin";
  else
    cout << "Nicky";
  return 0;
}
