#include<bits/stdc++.h>
#define Pii pair<int,int>
#define Fi first
#define Se second
#define lc p<<1
#define rc p<<1|1
#define ll long long
#define _ll __int128
#define lb(i) i&(-i)
#define Pli pair<ll,int>
#define ull unsigned long long
using namespace std;
namespace IO{
    char buf[1<<21],*p1=buf,*p2=buf;
    #define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
    inline bool Isdigit(char c){return c>='0'&&c<='9';}
    template<typename T>inline void read(T &x){
        x=0;char c=getchar();bool f=0;
        while(!Isdigit(c)){if(c=='-')f=1;c=getchar();}
        while(Isdigit(c))x=(x<<3)+(x<<1)+(c^48),c=getchar();
        x=f?-x:x;
    }
    template<typename T,typename ...Args>
    inline void read(T &x,Args &...args){read(x),read(args...);}
    static int stk[65],top;
    void Write(int x){if(x<0)putchar('-'),x=-x;if(!x)return putchar('0'),void();top=0;while(x){stk[++top]=x%10,x/=10;}while(top)putchar(stk[top--]^48);}
    void Write(ll x){if(x<0)putchar('-'),x=-x;if(!x)return putchar('0'),void();top=0;while(x){stk[++top]=x%10,x/=10;}while(top)putchar(stk[top--]^48);}
    void Write(_ll x){if(x<0)putchar('-'),x=-x;if(!x)return putchar('0'),void();top=0;while(x){stk[++top]=x%10,x/=10;}while(top)putchar(stk[top--]^48);}
    void Write(ull x){if(x<0)putchar('-'),x=-x;if(!x)return putchar('0'),void();top=0;while(x){stk[++top]=x%10,x/=10;}while(top)putchar(stk[top--]^48);}
    void Write(unsigned x){if(x<0)putchar('-'),x=-x;if(!x)return putchar('0'),void();top=0;while(x){stk[++top]=x%10,x/=10;}while(top)putchar(stk[top--]^48);}
    void Write(char c){putchar(c);}
    void Write(const char *c){while(*c)putchar(*c++);}
    template<typename T,typename ...Args>
    inline void Write(T x,Args ...args){Write(x),Write(args...);}
}
using namespace IO;
const int N=1e6+10,Mod=998244353;
const ll inf=1e9,Inf=2e18;
ll K,a[N],L[N],R[N];
int n,cnt,Res=1,Fl,Mx,P[N],Sum[N],S[N];
inline bool Check(ll x,ll y){
    if(min(x,y)>inf)return true;
    return (_ll)x*y*min(x,y)>K;
}
inline ll Get(ll x){return max((ll)sqrt(K/x),K/x/x);}
void Init(int n){
    for(int i=1;i<=n;i++)
        Sum[i]=(Sum[i-1]+(Get(i)+1)%Mod)%Mod;
    Mx=sqrtl(K/(N-9)),R[Mx+1]=N-10;
    for(int i=Mx;i>=1;i--){
        R[i]=K/i/i,L[i]=R[i+1]+1;
        // cout<<i<<" "<<L[i]<<" "<<R[i]<<endl;
        // cout<<(int)sqrt(K/L[i])<<" "<<(int)sqrt(K/R[i])<<" "<<(int)sqrt(K/(R[i]+1))<<endl;
        S[i]=(S[i+1]+1LL*(i+1)*((R[i]-L[i]+1)%Mod)%Mod)%Mod;
    }
}
inline int Solve(ll x,ll y){
    ll a=Get(x),b=Get(y);
    if(a>b){
        x^=y^=x^=y;
        a^=b^=a^=b;
    }
    // cout<<x<<" "<<a<<" "<<y<<" "<<b<<endl;
    if(a<=y)return (a+1)%Mod*((b+1)%Mod)%Mod;
    int Res=(y+1)%Mod*((b+1)%Mod)%Mod;
    if(a<=N-10)return ((Res+Sum[a])%Mod-Sum[y]+Mod)%Mod;
    else if(y<N-10)Res=((Res+Sum[N-10])%Mod-Sum[y]+Mod)%Mod;
    int h=sqrt(K/a);
    Res=(Res+S[h+1])%Mod;
    return (Res+1LL*(h+1)*((a-L[h]+1)%Mod)%Mod)%Mod;
}
int main(){
    // freopen("tower.in","r",stdin);
    // freopen("tower.out","w",stdout);
    read(n,K);
    P[cnt=1]=0,Init(N-10);
    for(int i=1;i<=n;i++){
        read(a[i]);
        if(a[i]!=-1)
            P[++cnt]=i;
    }
    P[++cnt]=n+1;
    for(int i=2;i<=cnt;i++)
        if(P[i]-P[i-1]==1){
            if(Check(a[P[i-1]],a[P[i]]))
                return Write("0\n"),0;
        }
        else if(P[i]-P[i-1]==2){
            if(a[P[i]]==0&&a[P[i-1]]==0)Fl=true;
            else Res=1LL*Res*((Get(max(a[P[i-1]],a[P[i]]))+1)%Mod)%Mod;
        }
        else{
            if(a[P[i]]==0||a[P[i-1]]==0)Fl=true;
            else Res=1LL*Res*Solve(a[P[i-1]],a[P[i]])%Mod;
        }
    Fl?Write("-1\n"):Write(Res,'\n');
}