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

#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define FORR(i, m, n) for (ll i = m; i >= n; i--)
#define REPO(i, n) for (ll i = 1; i <= n; i++)
#define ll long long
#define INF (ll)1ll << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(), n.end()
#define MOD (ll)1000000007
#define P pair<ll, ll>

ll mod = 998244353;
#define add(a, b) a = (a + b) % mod

int main() {
    int N, M, cnt = 0;
    cin >> N >> M;
    vector<int> s(N);
    vector<vector<ll>> dp(M + 2, vector<ll>(N + 2));
    REP(i, N) {
        cin >> s[i];
        if(s[i] == 1 and (i == 0 or s[i - 1] == 0)) cnt++;
    }
    dp[0][cnt] = 1;
    REP(i, M){
        REP(j, N + 1){
            if(j > 0) add(dp[i + 1][j - 1], dp[i][j] * 2 * j * (2 * j - 1) / 2);
            add(dp[i + 1][j], dp[i][j] * 2 * j * (N + 1 - 2 * j));
            if(2 * j + 1 <= N) add(dp[i + 1][j + 1], dp[i][j] * (N + 1 - 2 * j) * (N - 2 * j) / 2);
        }
    }
    cout << dp[M][0] << endl;
}