#include<bits/stdc++.h>
using namespace std;
const long long N=2e6+5,mod=998244353,inv2=(mod+1)/2;
long long n,C,ans=1,LIM;
long long a[N],s[N];

long long getlim(long long a){
	if(!a) return C;
	return max(C/a/a,(long long)sqrt(C/a));
}

long long S(long long x){
	return x*(x+1)%mod*inv2%mod;
}

long long cal(long long p,long long q){
	long long L=min(min(p,q),LIM),lim=min(L,(long long)sqrt(C/q));
	long long tot=(q+1+L+q*lim%mod+mod-S(lim)+s[L]+mod-s[lim])%mod;
	return tot;
}

int main(){
	cin>>n>>C;
	while(LIM+1<=C/(LIM+1)/(LIM+1)) LIM++;
	for(int i=1;i<=LIM;i++) s[i]=(s[i-1]+(C/i/i-i))%mod;
	
	for(long long i=1;i<=n;i++) cin>>a[i];
	
	for(long long l=0,r;l<=n;l=r){
		r=l+1;
		while(a[r]==-1) r++;
		if(r-l+(!a[l])+(!a[r])>3) return puts("-1"),0;
		if(r-l==1){
			if(a[l] && a[r] && min(a[l],a[r])>C/a[l]/a[r]) return puts("0"),0;
			else continue;
		}
		long long x=getlim(a[l]),y=getlim(a[r]);
		if(r-l==2){
			ans=ans*(min(x,y)+1)%mod;
			continue;
		}
		if(r-l==3){
			if(!x){
				ans=ans*(y+1)%mod;
				continue;
			}
			if(!y){
				ans=ans*(x+1)%mod;
				continue;
			}
			long long tot=min(min(x,y),LIM)+1;
			ans=ans*(cal(x,y)+cal(y,x)+mod-tot)%mod;
		}
		
	}
	cout<<ans;
}