#include<bits/stdc++.h>
using namespace std;
namespace my_std{
#define mems(x,y) memset(x,y,sizeof x)
#define Mp make_pair
#define eb emplace_back
#define gc getchar
#define pc putchar
#define fi first
#define se second
#define il inline
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define drep(i,a,b) for(int i=(a);i>=(b);i--)
#define go(i,u) for(int i=head[u];i;i=e[i].nxt)
	typedef long long ll;
	typedef pair<int,int> pii;
	template<typename T>
	il void read(T &x){
		int f=1;x=0;char c=gc();
		while(c<'0'||c>'9'){
			if(c=='-'){
				f=-1;
			}
			c=gc();
		}
		while(c>='0'&&c<='9'){
			x=x*10+c-48,c=gc();
		}
		x*=f;
	}
	template<typename T,typename ...Args>
	void read(T &x,Args &...args){
		read(x),read(args...);
	}
	template<typename T>
	il void write(T x){
		char buf[43];int len=0;
		if(x<0){
			pc('-'),x=-x;
		}
		do{
			buf[++len]=x%10,x/=10;
		}while(x);
		while(len){
			pc(buf[len--]+'0');
		}
	}
}
using namespace my_std;
const int N=1e6+7,M=-1,inf=0x3f3f3f3f,mod=998244353;
const ll INF=1ll*inf*inf;
int n,s[N];
ll m,lim,a[N],L[N];
il int Mod(int x,int y){
	return x+y>=mod?x+y-mod:x+y;
}
ll myCbrt(ll x){
	rep(i,0,1e6+1){
		if(1ll*i*i*i>x){
			return i-1;
		}
	}
	assert(0);
}
il ll calc(ll x){
	if(x>lim){
		return sqrt(m/x);
	}
	return m/(x*x);
}
il int getSum(ll l,ll r){
	ll x=sqrt(m/r),y=sqrt(m/l);
	if(x==y){
		return (r-l+1)%mod*x%mod;
	}
	int ret=0;
	ret=Mod(ret,(L[y-1]-l)%mod*y%mod);
	ret=Mod(ret,(r-L[x]+1)%mod*x%mod);
	ret=Mod(ret,Mod(s[y-1],mod-s[x]));
	return ret;
}
il int solve(ll x,ll y){
	if(!x||!y){
		return 0;
	}
	int t=0;
	if(x<=lim){
		if(y<x){
			t=Mod(t,y*(y+1)/2%mod);
			t=Mod(t,(x-y)*y%mod);
		}else{
			t=Mod(t,x*(x+1)/2%mod);
		}
	}else{
		if(y<lim){
			t=Mod(t,y*(y+1)/2%mod);
			t=Mod(t,(lim-y)*y%mod);
			ll p=L[y];
			if(p>=x){
				t=Mod(t,(x-lim)%mod*y%mod);
			}else{
				t=Mod(t,(p-lim)%mod*y%mod);
				t=Mod(t,getSum(p+1,x));
			}
		}else{
			t=Mod(t,lim*(lim+1)/2%mod);
			t=Mod(t,getSum(lim+1,x));
		}
	}
	return t;
}
void Yorushika(){
	read(n,m),lim=myCbrt(m);
	rep(i,1,n){
		read(a[i]);
	}
	L[0]=m;
	rep(i,1,lim){
		L[i]=m/(1ll*(i+1)*(i+1))+1;
		s[i]=Mod(s[i-1],(L[i-1]-L[i])%mod*i%mod);
	}
	rep(i,1,n-1){
		if(a[i]<=0||a[i+1]<=0){
			continue;
		}
		if(m/a[i]/a[i+1]<min(a[i],a[i+1])){
			puts("0");
			return;
		}
	}
	rep(i,1,n){
		if(a[i-1]<=0&&a[i]==-1&&a[i+1]<=0){
			puts("-1");
			return;
		}
	}
	int ans=1;
	rep(i,1,n){
		if(~a[i]||a[i-1]==-1){
			continue;
		}
		if(a[i+1]!=-1){
			ans=1ll*ans*(calc(max(a[i-1],a[i+1]))%mod+1)%mod;
		}else{
			ll x=calc(a[i-1]),y=calc(a[i+2]);
			ans=1ll*ans*Mod(Mod(Mod(solve(x,y),solve(y,x)),mod-min({lim,x,y})),Mod(x%mod,y%mod+1))%mod;
		}
	}
	printf("%d\n",ans);
}
signed main(){
	// freopen("tower.in","r",stdin);
	// freopen("tower.out","w",stdout);
	int t=1;
	//read(t);
	while(t--){
		Yorushika();
	}
}