#include <bits/stdc++.h>
using namespace std;
const int maxn = 200100, mod = 998244353;
inline void Add(int &a, int b) { a = a + b >= mod ? a + b - mod : a + b; }
inline int ksm(int a, int b) {
  int res = 1;
  for (; b; b >>= 1, a = 1ll * a * a % mod)
    if (b & 1) res = 1ll * res * a % mod;
  return res;
}
int fac[maxn], invfac[maxn];
inline int C(int n, int m) {
  return 1ll * fac[n] * invfac[m] % mod * invfac[n - m] % mod;
}
int n, k, a[maxn], cnt, ans = 0;
int main() {
  for (int i = fac[0] = 1; i < maxn; i++) fac[i] = 1ll * fac[i - 1] * i % mod;
  invfac[maxn - 1] = ksm(fac[maxn - 1], mod - 2);
  for (int i = maxn - 2; i >= 0; i--)
    invfac[i] = 1ll * invfac[i + 1] * (i + 1) % mod;
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%d", a + i);
  a[n + 1] = a[1];
  for (int i = 1; i <= n; i++) cnt += a[i] != a[i + 1];
  for (int i = 0; i < cnt; i++) {
    if ((cnt - i) & 1)
      Add(ans,
          1ll * ksm(k - 2, i) * C(cnt, i) % mod * ksm(2, cnt - i - 1) % mod);
    else
      Add(ans, 1ll * ksm(k - 2, i) * C(cnt, i) % mod *
                   ((ksm(2, cnt - i) - C(cnt - i, (cnt - i) >> 1) + mod) % mod *
                    499122177ll % mod) %
                   mod);
  }
  ans = 1ll * ans * ksm(k, n - cnt) % mod;
  printf("%d\n", ans);
  return 0;
}
