#include<bits/stdc++.h>
#define ll long long
#define R register
#define mk(x,y) make_pair(x,y)
#define PII pair<int,int>
using namespace std;
const int N=1e6+5,mod=998244353;
int n;ll k,a[N],m,pre[N<<1],lst,res=1;
inline ll f(ll x){
	if(!x)return k;
	if(x<=m)return k/x/x;
	return (ll)sqrt(k/x);
}
int main(){
	ios::sync_with_stdio(0);cin.tie(0),cout.tie(0);
	cin>>n>>k;m=cbrt(k);
	for(R int i=1;i<=n;++i)cin>>a[i];
	if(n==1)return cout<<(a[1]!=-1?1:-1),0;
	for(R int i=1;i<n;++i){
		if(a[i]!=-1&&a[i+1]!=-1){
			if(a[i]==0||a[i+1]==0)continue;
			__int128 tmp=a[i]*a[i+1];
			if(1.0*tmp>1.0*k/min(a[i],a[i+1]))return cout<<0,0;
		}
	}
	for(R int i=1;i<n;++i){
		if(i==1){
			if(a[i]==-1&&(a[i+1]==-1||a[i+1]==0))return cout<<-1,0;
		}else{
			if(a[i]==-1&&(a[i-1]==-1||a[i-1]==0)&&(a[i+1]==-1||a[i+1]==0))return cout<<-1,0;
		}
	}
	if((a[n]==-1)&&(a[n-1]==-1||a[n-1]==0))return cout<<-1,0;
	pre[0]=(k+1)%mod;
	for(R int i=1;i<=m;++i)pre[i]=(pre[i-1]+k/i/i+1)%mod;
	for(R int i=1;i<=n+1;++i){
		if(a[i]!=-1){
			if(lst==i-2){
				ll x=f(a[i-2]),y=f(a[i]);
				res=(res*(min(x,y)%mod+1)%mod)%mod;
			}
			if(lst==i-3){
				ll x=f(a[i-3]),y=f(a[i]);
				ll tmp=0;
				ll pos=y?min(min(x,m)+1,(ll)ceil(sqrt(1.0*k/y))):(min(x,m)+1);
				tmp=(tmp+(y+1)%mod*pos%mod+(pre[min(x,m)]-(pos?pre[pos-1]:0)+mod)%mod)%mod;
				pos=x?min(min(y,m)+1,(ll)ceil(sqrt(1.0*k/x))):(min(y,m)+1);
				tmp=(tmp+(x+1)%mod*pos%mod+(pre[min(y,m)]-(pos?pre[pos-1]:0)+mod)%mod)%mod;
				tmp=(tmp-(min(x,m)+1)*(min(y,m)+1)%mod+mod)%mod;
				res=(res*tmp)%mod;	
			}
			lst=i;
		}
	}
	cout<<res;
	return 0;
}