/**
	author:  shobonvip
	created: 2025.04.20 01:15:13
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n, m; cin >> n >> m;
	vector<int> a(n + 2);
	rep(i,0,n) {
		cin >> a[i+1];
	} 
	vector<int> b(n + 1);
	rep(i,0,n + 1) {
		b[i] = a[i] ^ a[i+1];
	}

	int ones = 0;

	rep(i,0,n + 1) {
		if (b[i] == 1) {
			ones++;
		}
	}

	vector dp(m + 1, vector<mint>(n + 2));
	dp[0][ones] = 1;

	mint inv2 = mint(2).inv();

	for (int i=0; i<m; i++) {
		for (int j=0; j<=n + 1; j++) {
			int c0 = n + 1 - j;
			int c1 = j;
			if (c0 >= 2) {
				dp[i+1][j+2] += dp[i][j] * c0 * (c0 - 1) * inv2;
			}
			if (c1 >= 2) {
				dp[i+1][j-2] += dp[i][j] * c1 * (c1 - 1) * inv2;
			}
			if (c0 >= 1 && c1 >= 1) {
				dp[i+1][j] += dp[i][j] * c0 * c1;
			}
		}
	}

	cout << dp[m][0].val() << endl;
}