#include <bits/stdc++.h>
template <typename T>
void MACRO_VAR_Scan(T& t) {
  std::cin >> t;
}
template <typename First, typename... Rest>
void MACRO_VAR_Scan(First& first, Rest&... rest) {
  std::cin >> first;
  MACRO_VAR_Scan(rest...);
}
template <typename T>
void MACRO_VEC_ROW_Init(int n, T& t) {
  t.resize(n);
}
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Init(int n, First& first, Rest&... rest) {
  first.resize(n);
  MACRO_VEC_ROW_Init(n, rest...);
}
template <typename T>
void MACRO_VEC_ROW_Scan(int p, T& t) {
  std::cin >> t[p];
}
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Scan(int p, First& first, Rest&... rest) {
  std::cin >> first[p];
  MACRO_VEC_ROW_Scan(p, rest...);
}
template <typename T>
void MACRO_OUT(const T t) {
  std::cout << t;
}
template <typename First, typename... Rest>
void MACRO_OUT(const First first, const Rest... rest) {
  std::cout << first << " ";
  MACRO_OUT(rest...);
}
template <class T>
inline T CHMAX(T& a, const T b) {
  return a = (a < b) ? b : a;
}
template <class T>
inline T CHMIN(T& a, const T b) {
  return a = (a > b) ? b : a;
}
template <class T>
using V = std::vector<T>;
template <class T>
using VV = V<V<T>>;
template <typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<ll, ll>;
using PAIRLL = std::pair<ll, ll>;
constexpr ll INFINT = (1 << 30) - 1;
constexpr ll INFINT_LIM = (1LL << 31) - 1;
constexpr ll INFLL = 1LL << 60;
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);
constexpr double EPS = 1e-10;
constexpr ll MOD = 998244353;
constexpr double PI = 3.141592653589793238462643383279;
template <class T, size_t N>
void FILL(T (&a)[N], const T& val) {
  for (auto& x : a) x = val;
}
template <class ARY, size_t N, size_t M, class T>
void FILL(ARY (&a)[N][M], const T& val) {
  for (auto& b : a) FILL(b, val);
}
template <class T>
void FILL(std::vector<T>& a, const T& val) {
  for (auto& x : a) x = val;
}
template <class ARY, class T>
void FILL(std::vector<std::vector<ARY>>& a, const T& val) {
  for (auto& b : a) FILL(b, val);
}
constexpr ll MAX_COMB_N = 2003;
ll comb[MAX_COMB_N + 1][MAX_COMB_N + 1];
struct InitComb {
  InitComb() {
    comb[0][0] = 1;
    for (ll i = 1; i <= MAX_COMB_N; ++i) {
      for (ll j = 0; j <= i; ++j) {
        if (j == 0 || j == i)
          comb[i][j] = 1;
        else
          comb[i][j] = (comb[i - 1][j - 1] + comb[i - 1][j]) % MOD;
      }
    }
  }
} init_comb;
signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
  ;
  ll n, k;
  MACRO_VAR_Scan(n, k);
  ;
  std::vector<ll> h(n);
  for (auto& i : h) std::cin >> i;
  ;
  if (k == 1) {
    MACRO_OUT(0);
    std::cout << "\n";
    ;
    return 0;
  }
  ll erasedCnt = 0;
  {
    V<ll> t;
    for (ll i = 0; i < ll(n); ++i) {
      if (h[i] == h[(i + 1) % n]) {
        ++erasedCnt;
      } else {
        t.emplace_back(h[i]);
      }
    }
    n = t.size();
    h = t;
  }
  V<ll> powk(n + 1, 1);
  for (ll i = (1); i < (n + 1); ++i) powk[i] = powk[i - 1] * (k - 2) % MOD;
  ll ans = 0;
  for (ll i = 0; i < ll(n + 1); ++i)
    for (ll j = (i + 1); j < (n + 1); ++j) {
      if (n - i - j < 0) break;
      (ans += comb[n][i] * comb[n - i][j] % MOD * powk[n - i - j] % MOD) %= MOD;
    }
  for (ll _ = 0; _ < ll(erasedCnt); ++_) {
    (ans *= k) %= MOD;
  }
  MACRO_OUT(ans);
  std::cout << "\n";
  ;
  return 0;
}
