#include <bits/stdc++.h>
inline int min(const int &first, const int &second) {
  return (((second - first) >> (32 - 1)) & (first ^ second)) ^ first;
}
inline int max(const int &first, const int &second) {
  return (((second - first) >> (32 - 1)) & (first ^ second)) ^ second;
}
inline long long min(const long long &first, const long long &second) {
  return (((second - first) >> (64 - 1)) & (first ^ second)) ^ first;
}
inline long long max(const long long &first, const long long &second) {
  return (((second - first) >> (64 - 1)) & (first ^ second)) ^ second;
}
using namespace std;
char string_in_buffer[(int)260];
void fast_scan(int &first) { scanf("%d", &first); }
void fast_scan(long long &first) { scanf("%lld", &first); }
void fast_scan(unsigned long long &first) { scanf("%llu", &first); }
void fast_scan(double &first) { scanf("%lf", &first); }
void fast_scan(long double &first) { scanf("%Lf", &first); }
void fast_scan(char &first) {
  scanf("%c", &first);
  if (first == '\n') {
    fast_scan(first);
  }
}
void fast_scan(string &first) {
  scanf("%s", string_in_buffer);
  first = string(string_in_buffer);
}
template <class TFirst, class TSecond>
void fast_scan(pair<TFirst, TSecond> &p) {
  fast_scan(p.first);
  fast_scan(p.second);
}
template <class T>
void fast_scan(vector<T> &v) {
  for (auto &first : v) fast_scan(first);
}
void fast_print(const int &first) { printf("%d", first); }
void fast_print(const unsigned int &first) { printf("%u", first); }
void fast_print(const long long &first) { printf("%lld", first); }
void fast_print(const unsigned long long &first) { printf("%llu", first); }
void fast_print(const char &first) { printf("%c", first); };
void fast_print(const double &first) { printf("%.15lf", first); }
void fast_print(const long double &first) { printf("%.15Lf", first); }
void fast_print(const string &first) { printf("%s", first.c_str()); }
void fast_print(const char v[]) { fast_print((string)v); }
template <class TFirst, class TSecond>
void fast_print(const pair<TFirst, TSecond> &p) {
  fast_print(p.first);
  fast_print(' ');
  fast_print(p.second);
}
template <class T>
void fast_print(const vector<T> &v) {
  if (v.empty()) return;
  fast_print(v[0]);
  for (int i = 1; i < v.size(); i++) {
    fast_print(' ');
    fast_print(v[i]);
  }
}
template <class T>
void fast_print(const vector<vector<T>> &v) {
  if (v.empty()) return;
  fast_print(v[0]);
  for (int i = 1; i < v.size(); i++) {
    fast_print('\n');
    fast_print(v[i]);
  }
}
template <class T>
void fast_print(const T &v) {
  for (const auto &first : v) {
    fast_print(first);
    fast_print(' ');
  }
}
using namespace std;
namespace smart_io {
string print_start = "";
string sep = " ";
bool first_print = false;
void precall_print() {
  fast_print(print_start);
  print_start = "\n";
  first_print = true;
}
void _print(deque<string>) {}
template <class T, class... Args>
void _print(deque<string> names, T elem, Args... args) {
  if (!first_print) {
    fast_print("\n");
  } else {
    first_print = false;
  }
  fast_print(names.front());
  fast_print(" = ");
  fast_print(elem);
  names.pop_front();
  _print(names, args...);
}
}  // namespace smart_io
template <class T>
ostream &operator,(ostream &os, const T &object) {
  if (!smart_io::first_print) {
    fast_print(smart_io::sep);
  } else {
    smart_io::first_print = false;
  }
  fast_print(object);
  return os;
}
template <class T>
istream &operator,(istream &is, T &object) {
  fast_scan(object);
  return is;
}
namespace escape__from__random__aetuhoetnuhshe {
using namespace std::chrono;
mt19937 rng(duration_cast<milliseconds>(system_clock::now().time_since_epoch())
                .count());
uniform_real_distribution<> prob_dist(0.0, 1.0);
};  // namespace escape__from__random__aetuhoetnuhshe
namespace typedefs {}
namespace numbers_operation {
template <class T>
inline T floor_mod(T a, const T &b) {
  a %= b;
  if (a < 0) a += b;
  return a;
}
}  // namespace numbers_operation
using namespace numbers_operation;
using namespace typedefs;
using namespace escape__from__random__aetuhoetnuhshe;
const long long MOD = 998244353;
long long mul(long long a, long long b) { return (a * b) % MOD; }
void add(long long &first, long long second) {
  first += second;
  if (first >= MOD) first -= MOD;
}
void subt(long long &first, long long second) {
  first -= second;
  if (first < 0) first += MOD;
}
long long fast_pow(long long first, long long p) {
  long long r = 1;
  while (p) {
    if (p & 1) r = mul(r, first);
    first = mul(first, first);
    p /= 2;
  }
  return r;
}
vector<long long> fact{1};
vector<long long> rfact{1};
vector<long long> twop{1};
vector<long long> k2p{1};
long long binom(long long n, long long k) {
  if (k > n) return 0LL;
  return mul(mul(fact[n], rfact[n - k]), rfact[k]);
}
signed main(signed argc, char *argv[]) {
  int n, k;
  cin, n, k;
  while (((int)fact.size()) < n + 100) {
    fact.push_back(mul(fact.back(), ((int)fact.size())));
    rfact.push_back(fast_pow(fact.back(), MOD - 2));
    twop.push_back(mul(twop.back(), 2));
    k2p.push_back(mul(k2p.back(), max(0LL, (long long)k - 2)));
  }
  vector<int> v(n);
  cin, v;
  long long offset = 1;
  long long m = 0;
  for (int i = 0; i < n; i++) {
    int j = (i + 1);
    if (j >= n) j -= n;
    if (v[i] == v[j]) {
      offset = mul(offset, k);
    } else {
      m++;
    }
  }
  long long inv2 = fast_pow(2, MOD - 2);
  long long rez = 0;
  for (long long val = 1; val <= m; val++) {
    if (val & 1) {
      add(rez, mul(k2p[m - val], mul(binom(m, val), twop[val - 1])));
    } else {
      long long sub = twop[val - 1];
      subt(sub, mul(binom(val, val / 2), inv2));
      add(rez, mul(k2p[m - val], mul(binom(m, val), sub)));
    }
  }
  smart_io::precall_print();
  cout, mul(rez, offset);
}
