#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = atcoder::modint998244353;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, k;
    cin >> n >> k;
    vector<int> a(n), sv(n + 1), sv2(n + 1);
    for(int i = 0; i < n; i++){
        cin >> a[i];
        sv[i + 1] = sv[i] + (abs(a[i]) == 2);
        sv2[i + 1] = sv2[i] ^ (a[i] < 0);
    }
    vector<mint> dp(n + 1), dp2(n + 1), tb(n + 1, mint::raw(1)), len(n + 1);
    for(int i = 1; i <= n; i++){
        len[i] = mint::raw(i).pow(k);
    }

    dp[0] = 1;
    for(int l = 0, r0 = 0, r1 = 0; l < n; l = max(l + 1, r0)){
        if(sv[l] % 3 != 0) continue;
        while(r0 <= n && sv[r0] <= sv[l]) r0++;
        while(r1 <= n && sv[r1] <= sv[l] + 3) r1++;
        int v = abs(sv[l]) + 3;
        if(abs(sv[r1 - 1]) != v) break;
        vector<mint> tmp{dp.begin() + l, dp.begin() + r0};
        vector<mint> coef{len.begin(), len.begin() + (r1 - l)};
        auto add = convolution(tmp, coef);
        vector<mint> tmp2{dp2.begin() + l, dp2.begin() + r0};
        vector<mint> coef2{tb.begin(), tb.begin() + (r1 - l)};
        auto add2 = convolution(tmp2, coef2);
        vector<mint> tmp3{dp.begin() + l, dp.begin() + r0};
        vector<mint> coef3{tb.begin(), tb.begin() + (r1 - l)};
        auto add3 = convolution(tmp3, coef3);
        for(int j = r1 - 1; abs(sv[j]) >= v; j--){
            if(sv[j] == v){
                dp2[j] += add[j - l] + add2[j - l];
                dp[j] += add3[j - l];
            }
        }
    }
    cout << dp2[n].val() << '\n';
}