#include <bits/stdc++.h>
typedef long long Int;
typedef __int128 i128;
const int M = 2e6 + 10, mod = 998244353;
const int i2 = (mod + 1) >> 1;

template<typename T>
inline T read() {
    char ch = getchar();
    T x = 0, f = 1;
    while ((ch < '0' || ch > '9') && ch != '-') ch = getchar();
    if (ch == '-') f = -1, ch = getchar();
    while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
    return x * f;
}

int n;
Int k, k2, k3, a[M], pre[M];

inline Int cal(Int x) {
    // min(p, x) * p * x <= k
    assert(x != 0);
    return x <= k3 ? (k / x / x) : (Int)sqrt(k / x);
}

inline int calc(Int x, Int y) {
    if (x > y) std::swap(x, y);
    Int a = cal(x), b = cal(y); // a >= b
    // printf("a = %lld, b = %lld\n", a, b);
    Int lm = std::min({a, b, k3});
    int ret = (a + b + lm + 1) % mod; // v = 0, u = 0, u = v >= 0

    Int p = std::min({lm, (Int)sqrt(1. * k / a)});
    ret = (ret + (pre[lm] - pre[p] + mod)) % mod;
    ret = (ret + p * (a % mod) % mod) % mod;
    ret = (ret + mod - lm % mod * (lm + 1) % mod * i2 % mod) % mod;
    
    p = std::min({lm, (Int)sqrt(1. * k / b)});
    ret = (ret + (pre[lm] - pre[p] + mod)) % mod;
    ret = (ret + p * (b % mod) % mod) % mod;
    ret = (ret + mod - lm % mod * (lm + 1) % mod * i2 % mod) % mod;

    return ret;
}

int main() {
    n = read<int>();
    k = read<Int>(), k2 = (Int)sqrt(k), k3 = (Int)cbrt(k);
    for (int i = 1; i <= n; i++) a[i] = read<Int>();

    for (int i = 1; i < M; i++)
        pre[i] = (pre[i - 1] + k / i / i) % mod;

    for (int i = 1; i < n; i++)
        if (a[i] > 0 && a[i + 1] > 0)
            if (k / a[i] / a[i + 1] < std::min(a[i], a[i + 1]))
                return printf("0\n"), 0;
    for (int i = 1; i <= n; i++)
        if (a[i - 1] <= 0 && a[i] == -1 && a[i + 1] <= 0)
            return printf("-1\n"), 0;
    
    int ans = 1;
    for (int i = 1; i <= n; ) {
        if (a[i] != -1) {
            i++;
            continue;
        }
        if (a[i + 1] != -1)
            ans = (cal(std::max(a[i - 1], a[i + 1])) + 1) % mod * ans % mod, i += 1;
        else
            ans = 1ll * ans * calc(a[i - 1], a[i + 2]) % mod, i += 2;
    }
    std::cout << ans << '\n';
    return 0;
}