#include <bits/stdc++.h>
using namespace std;
template <int MOD_>
struct modnum {
  static constexpr int MOD = MOD_;
  static_assert(MOD_ > 0, "MOD must be positive");

 private:
  using ll = long long;
  int v;
  static int minv(int a, int m) {
    a %= m;
    assert(a);
    return a == 1 ? 1 : int(m - ll(minv(m, a)) * ll(m) / a);
  }

 public:
  modnum() : v(0) {}
  modnum(ll v_) : v(int(v_ % MOD)) {
    if (v < 0) v += MOD;
  }
  explicit operator int() const { return v; }
  friend std::ostream& operator<<(std::ostream& out, const modnum& n) {
    return out << int(n);
  }
  friend std::istream& operator>>(std::istream& in, modnum& n) {
    ll v_;
    in >> v_;
    n = modnum(v_);
    return in;
  }
  friend bool operator==(const modnum& a, const modnum& b) {
    return a.v == b.v;
  }
  friend bool operator!=(const modnum& a, const modnum& b) {
    return a.v != b.v;
  }
  modnum inv() const {
    modnum res;
    res.v = minv(v, MOD);
    return res;
  }
  modnum neg() const {
    modnum res;
    res.v = v ? MOD - v : 0;
    return res;
  }
  modnum operator-() const { return neg(); }
  modnum operator+() const { return modnum(*this); }
  modnum& operator++() {
    v++;
    if (v == MOD) v = 0;
    return *this;
  }
  modnum& operator--() {
    if (v == 0) v = MOD;
    v--;
    return *this;
  }
  modnum& operator+=(const modnum& o) {
    v += o.v;
    if (v >= MOD) v -= MOD;
    return *this;
  }
  modnum& operator-=(const modnum& o) {
    v -= o.v;
    if (v < 0) v += MOD;
    return *this;
  }
  modnum& operator*=(const modnum& o) {
    v = int(ll(v) * ll(o.v) % MOD);
    return *this;
  }
  modnum& operator/=(const modnum& o) { return *this *= o.inv(); }
  friend modnum operator++(modnum& a, int) {
    modnum r = a;
    ++a;
    return r;
  }
  friend modnum operator--(modnum& a, int) {
    modnum r = a;
    --a;
    return r;
  }
  friend modnum operator+(const modnum& a, const modnum& b) {
    return modnum(a) += b;
  }
  friend modnum operator-(const modnum& a, const modnum& b) {
    return modnum(a) -= b;
  }
  friend modnum operator*(const modnum& a, const modnum& b) {
    return modnum(a) *= b;
  }
  friend modnum operator/(const modnum& a, const modnum& b) {
    return modnum(a) /= b;
  }
};
using num = modnum<998244353>;
num powmod(num a, long long b) {
  num r = 1;
  while (b) {
    if (b & 1) {
      r *= a;
    }
    a *= a;
    b /= 2;
  }
  return r;
}
const int MAXN = 2.1e5;
int N, K;
num f[MAXN][2];
num g[MAXN][3];
void precomp() {
  f[1][0] = K - 1;
  f[1][1] = 0;
  for (int n = 1; n < N; n++) {
    f[n + 1][0] += f[n][0] * (K - 2);
    f[n + 1][0] += f[n][1] * (K - 1);
    f[n + 1][1] += f[n][0] * 1;
  }
  g[1][0] = K - 2;
  g[1][1] = 0;
  g[1][2] = 1;
  for (int n = 1; n < N; n++) {
    g[n + 1][0] += g[n][0] * (K - 3);
    g[n + 1][0] += g[n][1] * (K - 2);
    g[n + 1][0] += g[n][2] * (K - 2);
    g[n + 1][1] += g[n][0];
    g[n + 1][1] += g[n][2];
    g[n + 1][2] += g[n][0];
    g[n + 1][2] += g[n][1];
  }
}
num gogo(vector<int> a) {
  int cnt = 0;
  for (int v : a) {
    cnt += (v != -1);
  }
  assert(a.size());
  if (cnt == 0) {
    return num(K) * powmod(K - 1, int(a.size()) - 1);
  } else if (cnt == 1) {
    return powmod(K - 1, int(a.size()) - 1);
  } else {
    assert(a[0] != -1 && a.back() != -1);
    assert(cnt == 2);
    int r = int(a.size()) - 2;
    if (a[0] == a.back()) {
      return f[r][0];
    } else {
      if (r == 0) return 1;
      return g[r][0] + g[r][1];
    }
  }
}
num go(vector<int> a) {
  int n = int(a.size());
  num res = 1;
  for (int st = 0; st < n;) {
    int en = st + 1;
    while (en < n && a[en] == -1) {
      en++;
    }
    if (en == n) en--;
    res *= gogo(vector<int>(a.begin() + st, a.begin() + en + 1));
    if (en == n - 1) break;
    st = en;
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> N >> K;
  precomp();
  vector<int> A[2];
  for (int i = 0; i < N; i++) {
    int v;
    cin >> v;
    A[i % 2].push_back(v);
  }
  num ans = go(A[0]) * go(A[1]);
  cout << ans << '\n';
  return 0;
}
