#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
namespace IO{
	static char buf[1000000],*p1=buf,*p2=buf;
	#define GC()	(p1==p2&&(p2=(p1=buf)+fread(buf,1,1000000,stdin),p1==p2)?EOF:*p1++)
	ll read(){
		ll x = 0; bool fl = false; char c = GC();
		while(c < '0' || c > '9'){
			if(c == '-') fl = true;
			c = GC();
		}
		while(c >= '0' && c <= '9'){
			x = (x << 3) + (x << 1) + c - '0'; c = GC();
		}
		return fl ? -x : x;
	}
}
using namespace IO;
const int mxn = 1e6+10, mxB = 1e6+10, mxm = 1e9, mod = 998244353;
const ll inf = 1e18;
int n, ans = 1, s[mxB];
ll k, B, a[mxn], b[mxn], f[mxB];
int mysqrt(ll x){
	int l = 0, r = min(x, (ll)mxm), md;
	while(l < r){
		md = l + r + 1 >> 1;
		if((ll)md * md <= x) l = md;
		else r = md - 1;
	}
	return l;
}
ll calc(ll x, ll y){
	int res = (x + y + 1) % mod;
	int l, r, rr = min(B, x), md;
	l = 0; r = rr;
	while(l < r){
		md = l + r + 1 >> 1;
		if(y <= f[md]) l = md;
		else r = md - 1;
	}
	res = (res + l * y + s[rr] + mod - s[l]) % mod;
	if(x <= B) return res;
	l = 0; r = rr = min(B, y);
	while(l < r){
		md = l + r + 1 >> 1;
		if(x <= f[md]) l = md;
		else r = md - 1;
	}
	res = (res + l * x + s[rr] + mod - s[l] + mod - rr * B % mod) % mod;
	return res;
}
int main()
{
	int i;
	n = read(); k = read();
	B = 0;
	while(B * B * B <= k) B++;
	B--;
	for(i = 1, f[0] = s[0] = 0; i <= B; i++){
		f[i] = k / i / i;
		s[i] = (s[i - 1] + f[i]) % mod;
	}
	for(i = 1; i <= n; i++){
		a[i] = read();
	}
	a[0] = a[n + 1] = 0;
	for(i = 0; i <= n + 1; i++){
		if(a[i] > 0){
			b[i] = (a[i] <= B ? k / a[i] / a[i] : mysqrt(k / a[i]));
		}else b[i] = inf;
	}
	for(i = 1; i < n; i++){
		if(a[i] > b[i + 1]){ printf("0"); return 0; }
	}
	for(i = 1; i <= n; i++){
		if(a[i] < 0 && a[i - 1] <= 0 && a[i + 1] <= 0){ printf("-1"); return 0; }
	}
	for(i = 1; i <= n; i++){
		if(a[i] >= 0) continue;
		if(a[i + 1] < 0){
			ans = ans * calc(b[i - 1], b[i + 2]) % mod;
			i++;
		}else{
			ans = (min(b[i - 1], b[i + 1]) + 1) % mod * ans % mod;
		}
	}
	printf("%d", ans);
	return 0;
}