#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  VI a(n);
  rep(i, n) cin >> a[i];
  int odd_init = 0;
  rep(i, n - 1) odd_init += a[i] != a[i+1];
  odd_init += a.front() + a.back();
  vector<mint> dp(n + 2), ndp;
  dp[odd_init] = 1;
  const mint inv2 = mint(2).inv();
  rep(_, m) {
    ndp.assign(n + 2, 0);
    rep(odd, n + 2) {
      int even = n + 1 - odd;
      if (odd >= 2) ndp[odd - 2] += dp[odd] * odd * (odd - 1) * inv2;
      if (even >= 2) ndp[odd + 2] += dp[odd] * even * (even - 1) * inv2;
      if (odd >= 1 && even >= 1) ndp[odd] += dp[odd] * odd * even;
    }
    swap(dp, ndp);
  }
  cout << dp[0].val() << '\n';
}