#include <bits/stdc++.h>
using namespace std;
const int N = 100000;
const int inf = (int)1e9 + 1;
const long long big = (long long)1e18 + 1;
const int P = 239;
const int MOD = (int)1e9 + 7;
const int MOD1 = (int)1e9 + 9;
const double eps = 1e-9;
const double pi = atan2(0, -1);
const int ABC = 26;
int nim0[10] = {0, 1, 2, 0, 1, 0, 1, 0, 1, 0};
int nim1[10] = {0, 1, 0, 1, 2, 0, 2, 0, 1, 0};
int get0(int x) {
  if (x < 10)
    return nim0[x];
  else
    return (x % 2 == 0 ? 1 : 0);
}
int get1(int x) {
  if (x < 10)
    return nim1[x];
  else {
    if (x % 2 == 1) return 0;
    int tmp = get1(x / 2);
    int ans = 0;
    while (ans == 0 || ans == tmp) ans++;
    return ans;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.precision(20);
  int n, k;
  cin >> n >> k;
  int ans = 0;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    if (k % 2 == 0)
      ans ^= get0(x);
    else
      ans ^= get1(x);
  }
  cout << (ans ? "Kevin\n" : "Nicky\n");
  return 0;
}
