#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

#include <atcoder/convolution>
using mint = atcoder::modint998244353;


void solve();
// POP'N ROLL MUSIC / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N, K;
    cin >> N >> K;
    vector<mint> to(N + 1);
    rep(i, 1, N + 1) to[i] = (mint(i)).pow(K);
    vector<mint> dp1(N + 1), dp2(N + 1);
    dp1[0] = 1;
    vector<vector<int>> G(N);
    int C = 0;
    int M = 0;
    G[0] = {0};
    rep(i, 0, N){
        int a;
        cin >> a;
        if (abs(a) == 2) C++;
        if (a < 0) M ^= 1;
        if (M == 0 && C % 3 == 0 && C != 0) G[C / 3].push_back(i + 1);
    }
    if (M != 0 || C % 3 != 0){
        cout << "0\n";
        return;
    }
    G.resize(C / 3 + 1);
    rep(i, 0, C / 3){
        if (G[i + 1].empty()){
            cout << "0\n";
            return;
        }
        int l = G[i][0];
        int r = G[i + 1].back() + 1;
        vector<mint> A(r - l), B(r - l);
        // vec_out(G[i]);
        // vec_out(G[i + 1]);
        // cout << l << " " << r << endl;
        mint sum1 = 0, sum2 = 0;
        for (auto x : G[i]) A[x - l] = dp1[x], sum1 += dp1[x], sum2 += dp2[x];
        rep(j, 0, r - l) B[j] = to[j];
        A = atcoder::convolution(A, B);
        for (auto x : G[i + 1]) dp2[x] = A[x - l] + sum2, dp1[x] = sum1;
    }
    cout << dp2[N].val() << "\n";
}