#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

class Comb
{
  int siz, mod;
  std::vector<long long> _fac, _inv, _finv;
public:
  // 引数は (mod)
  Comb(int m) : mod(m), siz(2)
  {
    _fac.resize(siz);
    _inv.resize(siz);
    _finv.resize(siz);
    _fac[0] = _fac[1] = _inv[1] = _finv[0] = _finv[1] = 1;
  }
  long long p(int n, int k)
  {
    if (n < k || k < 0) return 0;
    resize(n + 1);
    return _fac[n] * _finv[n - k] % mod;
  }
  long long c(int n, int k)
  {
    if (n < k || k < 0) return 0;
    resize(n + 1);
    return _fac[n] * _finv[k] % mod * _finv[n - k] % mod;
  }
  long long inv(int n)
  {
    resize(n + 1);
    if (n < 0) return 0;
    else return _inv[n];
  }
  long long fac(int n)
  {
    resize(n + 1);
    if (n < 0) return 0;
    else return _fac[n];
  }
  long long finv(int n)
  {
    resize(n + 1);
    if (n < 0) return 0;
    else return _finv[n];
  }
private:
  void resize(int n)
  {
    if (n <= siz) return;
    for (int i = siz; i < n; ++i)
    {
      _fac.push_back((long long)i * _fac[i - 1] % mod);
      _inv.push_back(mod - _inv[mod % i] * (mod / i) % mod);
      _finv.push_back(_finv[i - 1] * _inv[i] % mod);
    }
    siz = n;
  }
};

int main()
{
  const int mod = 998244353;
  int n, m;
  cin >> n >> m;
  vector<int> a(n), b(n + 1);
  for (int i = 0; i < n; ++i) cin >> a[i];
  b[0] = a[0];
  b[n] = a[n - 1];
  int siz = n + 1;
  for (int i = 1; i < n; ++i) b[i] = (a[i - 1] ^ a[i]);
  vector<long long> dp(siz + 1);
  int cnt = 0;
  for (int i = 0; i <= n; ++i) cnt += (b[i] == 0);
  dp[cnt] = 1;
  Comb cb(mod);
  for (int i = 0; i < m; ++i)
  {
    vector<long long> ndp(siz + 1);
    for (int j = 0; j <= siz; ++j)
    {
      if (j - 2 >= 0) ndp[j - 2] = (ndp[j - 2] + cb.c(j, 2) * dp[j]) % mod;
      ndp[j] = (ndp[j] + dp[j] * j % mod * (siz - j)) % mod;
      if (j + 2 <= siz) ndp[j + 2] = (ndp[j + 2] + cb.c(siz - j, 2) * dp[j]) % mod;
    }
    swap(dp, ndp);
  }
  cout << dp[n + 1] << endl;
}