#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=4005,INF=1<<30;

//多倍長

// https://github.com/beet-aizu/library/blob/master/tools/bigint.cpp

namespace FFT{
    using dbl = double;
    
    struct num{
        dbl x,y;
        num(){x=y=0;}
        num(dbl x,dbl y):x(x),y(y){}
    };
    
    inline num operator+(num a,num b){
        return num(a.x+b.x,a.y+b.y);
    }
    inline num operator-(num a,num b){
        return num(a.x-b.x,a.y-b.y);
    }
    inline num operator*(num a,num b){
        return num(a.x*b.x-a.y*b.y,a.x*b.y+a.y*b.x);
    }
    inline num conj(num a){
        return num(a.x,-a.y);
    }
    
    int base=1;
    vector<num> rts={{0,0},{1,0}};
    vector<int> rev={0,1};
    
    const dbl PI=asinl(1)*2;
    
    void ensure_base(int nbase){
        if(nbase<=base) return;
        
        rev.resize(1<<nbase);
        for(int i=0;i<(1<<nbase);i++)
            rev[i]=(rev[i>>1]>>1)+((i&1)<<(nbase-1));
        
        rts.resize(1<<nbase);
        while(base<nbase){
            dbl angle=2*PI/(1<<(base+1));
            for(int i=1<<(base-1);i<(1<<base);i++){
                rts[i<<1]=rts[i];
                dbl angle_i=angle*(2*i+1-(1<<base));
                rts[(i<<1)+1]=num(cos(angle_i),sin(angle_i));
            }
            base++;
        }
    }
    
    void fft(vector<num> &as){
        int n=as.size();
        assert((n&(n-1))==0);
        
        int zeros=__builtin_ctz(n);
        ensure_base(zeros);
        int shift=base-zeros;
        for(int i=0;i<n;i++)
            if(i<(rev[i]>>shift))
                swap(as[i],as[rev[i]>>shift]);
        
        for(int k=1;k<n;k<<=1){
            for(int i=0;i<n;i+=2*k){
                for(int j=0;j<k;j++){
                    num z=as[i+j+k]*rts[j+k];
                    as[i+j+k]=as[i+j]-z;
                    as[i+j]=as[i+j]+z;
                }
            }
        }
    }
    
    template<typename T>
    vector<long long> multiply(vector<T> &as,vector<T> &bs){
        int need=as.size()+bs.size()-1;
        int nbase=0;
        while((1<<nbase)<need) nbase++;
        ensure_base(nbase);
        
        int sz=1<<nbase;
        vector<num> fa(sz);
        for(int i=0;i<sz;i++){
            T x=(i<(int)as.size()?as[i]:0);
            T y=(i<(int)bs.size()?bs[i]:0);
            fa[i]=num(x,y);
        }
        fft(fa);
        
        num r(0,-0.25/sz);
        for(int i=0;i<=(sz>>1);i++){
            int j=(sz-i)&(sz-1);
            num z=(fa[j]*fa[j]-conj(fa[i]*fa[i]))*r;
            if(i!=j)
                fa[j]=(fa[i]*fa[i]-conj(fa[j]*fa[j]))*r;
            fa[i]=z;
        }
        fft(fa);
        
        vector<long long> res(need);
        for(int i=0;i<need;i++)
            res[i]=round(fa[i].x);
        
        return res;
    }
    
};
//BEGIN CUT HERE
struct bigint {
    using ll = long long;
    using vll = vector<ll>;
    
    inline static constexpr ll base_digits = 9;
    inline static constexpr ll base = 1000000000;
    
    vll a;
    ll sign;
    
    bigint():sign(1){}
    
    bigint(ll v){*this=v;}
    
    bigint(const string &s){read(s);}
    
    static bigint add_identity(){return bigint(0);}
    static bigint mul_identity(){return bigint(1);}
    
    void operator=(ll v){
        sign=1;
        if(v<0) sign=-1,v=-v;
        for(;v>0;v=v/base) a.emplace_back(v%base);
    }
    
    bigint operator+(const bigint &v) const{
        if(sign==v.sign){
            bigint res=v;
            for(ll i=0,carry=0;i<(ll)max(a.size(),v.a.size()) or carry;++i){
                if(i==(ll)res.a.size()) res.a.emplace_back(0);
                res.a[i]+=carry+(i<(ll)a.size()?a[i]:0);
                carry=res.a[i]>=base;
                if(carry) res.a[i]-=base;
            }
            return res;
        }
        return *this-(-v);
    }
    
    bigint operator-(const bigint &v) const{
        if(sign==v.sign){
            if(abs()>=v.abs()){
                bigint res=*this;
                for(ll i=0,carry=0;i<(ll)v.a.size() or carry;++i){
                    res.a[i]-=carry+(i<(ll)v.a.size()?v.a[i]:0);
                    carry=res.a[i]<0;
                    if(carry) res.a[i]+=base;
                }
                res.trim();
                return res;
            }
            return -(v-*this);
        }
        return *this+(-v);
    }
    
    void operator*=(ll v){
        if(v<0) sign=-sign,v=-v;
        for(ll i=0,carry=0;i<(ll)a.size() or  carry;++i){
            if(i ==(ll)a.size()) a.emplace_back(0);
            ll cur=a[i] *(ll)v+carry;
            carry=(ll)(cur/base);
            a[i]=(ll)(cur%base);
            // asm("divl %%ecx" : "=a"(carry),"=d"(a[i]) : "A"(cur),"c"(base));
        }
        trim();
    }
    
    bigint operator*(ll v) const{
        bigint res=*this;
        res*=v;
        return res;
    }
    
    friend pair<bigint,bigint> divmod(const bigint &a1,const bigint &b1){
        ll norm=base/(b1.a.back()+1);
        bigint a=a1.abs()*norm;
        bigint b=b1.abs()*norm;
        bigint q,r;
        q.a.resize(a.a.size());
        
        for(ll i=a.a.size()-1;i>=0;i--){
            r *=base;
            r+=a.a[i];
            ll s1=r.a.size()<=b.a.size() ? 0 : r.a[b.a.size()];
            ll s2=r.a.size()<=b.a.size()-1 ? 0 : r.a[b.a.size()-1];
            ll d=((ll)base*s1+s2)/b.a.back();
            r-=b*d;
            while(r<0) r+=b,--d;
            q.a[i]=d;
        }
        
        q.sign=a1.sign*b1.sign;
        r.sign=a1.sign;
        q.trim();
        r.trim();
        return make_pair(q,r/norm);
    }
    
    bigint operator/(const bigint &v) const{
        return divmod(*this,v).first;
    }
    
    bigint operator%(const bigint &v) const{
        return divmod(*this,v).second;
    }
    
    void operator/=(ll v){
        if(v<0) sign=-sign,v=-v;
        for(ll i=(ll)a.size()-1,rem=0;i>=0;--i){
            ll cur=a[i]+rem *(ll)base;
            a[i]=(ll)(cur/v);
            rem=(ll)(cur%v);
        }
        trim();
    }
    
    bigint operator/(ll v) const{
        bigint res=*this;
        res/=v;
        return res;
    }
    
    ll operator%(ll v) const{
        if(v<0) v=-v;
        ll m=0;
        for(ll i=a.size()-1;i>=0;--i) m=(a[i]+m*(ll)base)%v;
        return m*sign;
    }
    
    void operator+=(const bigint &v){
        *this=*this+v;
    }
    
    void operator-=(const bigint &v){
        *this=*this-v;
    }
    
    void operator*=(const bigint &v){
        *this=*this*v;
    }
    
    void operator/=(const bigint &v){
        *this=*this/v;
    }
    
    bool operator<(const bigint &v) const{
        if(sign!=v.sign) return sign<v.sign;
        if(a.size()!=v.a.size()) return a.size()*sign<v.a.size()*v.sign;
        for(ll i=a.size()-1;i>=0;i--)
            if(a[i]!=v.a[i]) return a[i]*sign<v.a[i]*sign;
        return false;
    }
    
    bool operator>(const bigint &v) const{
        return v<*this;
    }
    
    bool operator<=(const bigint &v) const{
        return !(v<*this);
    }
    
    bool operator>=(const bigint &v) const{
        return !(*this<v);
    }
    
    bool operator==(const bigint &v) const{
        return !(*this<v) and !(v<*this);
    }
    
    bool operator!=(const bigint &v) const{
        return *this<v or v<*this;
    }
    
    void trim(){
        while(!a.empty() and !a.back()) a.pop_back();
        if(a.empty()) sign=1;
    }
    
    bool isZero() const{
        return a.empty() or (a.size()==1 and !a[0]);
    }
    
    bigint operator-() const{
        bigint res=*this;
        res.sign=-sign;
        return res;
    }
    
    bigint abs() const{
        bigint res=*this;
        res.sign*=res.sign;
        return res;
    }
    
    ll longValue() const{
        ll res=0;
        for(ll i=a.size()-1;i>=0;i--) res=res*base+a[i];
        return res*sign;
    }
    
    friend bigint gcd(const bigint &a,const bigint &b){
        return b.isZero()?a:gcd(b,a%b);
    }
    
    friend bigint lcm(const bigint &a,const bigint &b){
        return a/gcd(a,b)*b;
    }
    
    void read(const string &s){
        sign=1;
        a.clear();
        ll pos=0;
        while(pos<(ll)s.size() and (s[pos]=='-' or s[pos]=='+')){
            if(s[pos]=='-') sign=-sign;
            ++pos;
        }
        for(ll i=s.size()-1;i>=pos;i-=base_digits){
            ll x=0;
            for(ll j=max(pos,i-base_digits+1);j<=i;j++) x=x*10+s[j]-'0';
            a.emplace_back(x);
        }
        trim();
    }
    
    friend istream &operator>>(istream &stream,bigint &v){
        string s;
        stream>>s;
        v.read(s);
        return stream;
    }
    
    friend ostream &operator<<(ostream &stream,const bigint &v){
        if(v.sign==-1) stream<<'-';
        stream<<(v.a.empty()?0:v.a.back());
        for(ll i=(ll)v.a.size()-2;i>=0;--i)
            stream<<setw(base_digits)<<setfill('0')<<v.a[i];
        return stream;
    }
    
    static vll convert_base(const vll &a,ll old_digits,ll new_digits){
        vll p(max(old_digits,new_digits)+1);
        p[0]=1;
        for(ll i=1;i<(ll)p.size();i++) p[i]=p[i-1]*10;
        vll res;
        ll cur=0;
        ll cur_digits=0;
        for(ll i=0;i<(ll)a.size();i++){
            cur+=a[i]*p[cur_digits];
            cur_digits+=old_digits;
            while(cur_digits>=new_digits){
                res.emplace_back(signed(cur%p[new_digits]));
                cur/=p[new_digits];
                cur_digits-=new_digits;
            }
        }
        res.emplace_back((signed)cur);
        while(!res.empty() and !res.back()) res.pop_back();
        return res;
    }
    
    static vll karatsubaMultiply(vll &a,vll &b){
        {
            while(a.size()<b.size()) a.emplace_back(0);
            while(b.size()<a.size()) b.emplace_back(0);
            while(a.size()&(a.size()-1)) a.emplace_back(0),b.emplace_back(0);
        }
        
        ll n=a.size();
        vll res(n+n);
        if(n<=32){
            for(ll i=0;i<n;i++)
                for(ll j=0;j<n;j++)
                    res[i+j]+=a[i]*b[j];
            return res;
        }
        
        ll k=n>>1;
        vll a1(a.begin(),a.begin()+k);
        vll a2(a.begin()+k,a.end());
        vll b1(b.begin(),b.begin()+k);
        vll b2(b.begin()+k,b.end());
        
        vll a1b1=karatsubaMultiply(a1,b1);
        vll a2b2=karatsubaMultiply(a2,b2);
        
        for(ll i=0;i<k;i++) a2[i]+=a1[i];
        for(ll i=0;i<k;i++) b2[i]+=b1[i];
        
        vll r=karatsubaMultiply(a2,b2);
        for(ll i=0;i<(ll)a1b1.size();i++) r[i]-=a1b1[i];
        for(ll i=0;i<(ll)a2b2.size();i++) r[i]-=a2b2[i];
        
        for(ll i=0;i<(ll)r.size();i++) res[i+k]+=r[i];
        for(ll i=0;i<(ll)a1b1.size();i++) res[i]+=a1b1[i];
        for(ll i=0;i<(ll)a2b2.size();i++) res[i+n]+=a2b2[i];
        return res;
    }
    
    bigint operator*(const bigint &v) const{
        constexpr static ll nbase = 10000;
        constexpr static ll nbase_digits = 4;
        
        vll a=convert_base(this->a,base_digits,nbase_digits);
        vll b=convert_base(v.a,base_digits,nbase_digits);
        
        if(a.empty() or b.empty()) return bigint(0);
        
        vll c=karatsubaMultiply(a,b);
        // vll c=FFT::multiply(a,b);
        
        bigint res;
        res.sign=sign*v.sign;
        for(ll i=0,carry=0;i<(ll)c.size();i++){
            ll cur=c[i]+carry;
            res.a.emplace_back((ll)(cur%nbase));
            carry=(ll)(cur/nbase);
            if(i+1==(int)c.size() and carry>0) c.emplace_back(0);
        }
        
        res.a=convert_base(res.a,nbase_digits,base_digits);
        res.trim();
        return res;
    }
};
//END CUT HERE

// FPS 全部載せ

// from: https://gist.github.com/yosupo06/ddd51afb727600fd95d9d8ad6c3c80c9
// (based on AtCoder STL)

#include <algorithm>
#include <array>

#ifdef _MSC_VER
#include <intrin.h>
#endif

namespace atcoder {
    
    namespace internal {
        
        int ceil_pow2(int n) {
            int x = 0;
            while ((1U << x) < (unsigned int)(n)) x++;
            return x;
        }
        
        int bsf(unsigned int n) {
#ifdef _MSC_VER
            unsigned long index;
            _BitScanForward(&index, n);
            return index;
#else
            return __builtin_ctz(n);
#endif
        }
        
    }  // namespace internal
    
}  // namespace atcoder



#include <utility>

namespace atcoder {
    
    namespace internal {
        
        constexpr long long safe_mod(long long x, long long m) {
            x %= m;
            if (x < 0) x += m;
            return x;
        }
        
        struct barrett {
            unsigned int _m;
            unsigned long long im;
            
            barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}
            
            unsigned int umod() const { return _m; }
            
            unsigned int mul(unsigned int a, unsigned int b) const {
                
                unsigned long long z = a;
                z *= b;
#ifdef _MSC_VER
                unsigned long long x;
                _umul128(z, im, &x);
#else
                unsigned long long x =
                (unsigned long long)(((unsigned __int128)(z)*im) >> 64);
#endif
                unsigned int v = (unsigned int)(z - x * _m);
                if (_m <= v) v += _m;
                return v;
            }
        };
        
        constexpr long long pow_mod_constexpr(long long x, long long n, int m) {
            if (m == 1) return 0;
            unsigned int _m = (unsigned int)(m);
            unsigned long long r = 1;
            unsigned long long y = safe_mod(x, m);
            while (n) {
                if (n & 1) r = (r * y) % _m;
                y = (y * y) % _m;
                n >>= 1;
            }
            return r;
        }
        
        constexpr bool is_prime_constexpr(int n) {
            if (n <= 1) return false;
            if (n == 2 || n == 7 || n == 61) return true;
            if (n % 2 == 0) return false;
            long long d = n - 1;
            while (d % 2 == 0) d /= 2;
            for (long long a : {2, 7, 61}) {
                long long t = d;
                long long y = pow_mod_constexpr(a, t, n);
                while (t != n - 1 && y != 1 && y != n - 1) {
                    y = y * y % n;
                    t <<= 1;
                }
                if (y != n - 1 && t % 2 == 0) {
                    return false;
                }
            }
            return true;
        }
        template <int n> constexpr bool is_prime = is_prime_constexpr(n);
        
        constexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {
            a = safe_mod(a, b);
            if (a == 0) return {b, 0};
            
            long long s = b, t = a;
            long long m0 = 0, m1 = 1;
            
            while (t) {
                long long u = s / t;
                s -= t * u;
                m0 -= m1 * u;  // |m1 * u| <= |m1| * s <= b
                
                
                auto tmp = s;
                s = t;
                t = tmp;
                tmp = m0;
                m0 = m1;
                m1 = tmp;
            }
            if (m0 < 0) m0 += b / s;
            return {s, m0};
        }
        
        constexpr int primitive_root_constexpr(int m) {
            if (m == 2) return 1;
            if (m == 167772161) return 3;
            if (m == 469762049) return 3;
            if (m == 754974721) return 11;
            if (m == 998244353) return 3;
            int divs[20] = {};
            divs[0] = 2;
            int cnt = 1;
            int x = (m - 1) / 2;
            while (x % 2 == 0) x /= 2;
            for (int i = 3; (long long)(i)*i <= x; i += 2) {
                if (x % i == 0) {
                    divs[cnt++] = i;
                    while (x % i == 0) {
                        x /= i;
                    }
                }
            }
            if (x > 1) {
                divs[cnt++] = x;
            }
            for (int g = 2;; g++) {
                bool ok = true;
                for (int i = 0; i < cnt; i++) {
                    if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {
                        ok = false;
                        break;
                    }
                }
                if (ok) return g;
            }
        }
        template <int m> constexpr int primitive_root = primitive_root_constexpr(m);
        
    }  // namespace internal
    
}  // namespace atcoder


#include <cassert>
#include <numeric>
#include <type_traits>

namespace atcoder {
    
    namespace internal {
        
#ifndef _MSC_VER
        template <class T>
        using is_signed_int128 =
        typename std::conditional<std::is_same<T, __int128_t>::value ||
        std::is_same<T, __int128>::value,
        std::true_type,
        std::false_type>::type;
        
        template <class T>
        using is_unsigned_int128 =
        typename std::conditional<std::is_same<T, __uint128_t>::value ||
        std::is_same<T, unsigned __int128>::value,
        std::true_type,
        std::false_type>::type;
        
        template <class T>
        using make_unsigned_int128 =
        typename std::conditional<std::is_same<T, __int128_t>::value,
        __uint128_t,
        unsigned __int128>;
        
        template <class T>
        using is_integral = typename std::conditional<std::is_integral<T>::value ||
        is_signed_int128<T>::value ||
        is_unsigned_int128<T>::value,
        std::true_type,
        std::false_type>::type;
        
        template <class T>
        using is_signed_int = typename std::conditional<(is_integral<T>::value &&
                                                         std::is_signed<T>::value) ||
        is_signed_int128<T>::value,
        std::true_type,
        std::false_type>::type;
        
        template <class T>
        using is_unsigned_int =
        typename std::conditional<(is_integral<T>::value &&
                                   std::is_unsigned<T>::value) ||
        is_unsigned_int128<T>::value,
        std::true_type,
        std::false_type>::type;
        
        template <class T>
        using to_unsigned = typename std::conditional<
        is_signed_int128<T>::value,
        make_unsigned_int128<T>,
        typename std::conditional<std::is_signed<T>::value,
        std::make_unsigned<T>,
        std::common_type<T>>::type>::type;
        
#else
        
        template <class T> using is_integral = typename std::is_integral<T>;
        
        template <class T>
        using is_signed_int =
        typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,
        std::true_type,
        std::false_type>::type;
        
        template <class T>
        using is_unsigned_int =
        typename std::conditional<is_integral<T>::value &&
        std::is_unsigned<T>::value,
        std::true_type,
        std::false_type>::type;
        
        template <class T>
        using to_unsigned = typename std::conditional<is_signed_int<T>::value,
        std::make_unsigned<T>,
        std::common_type<T>>::type;
        
#endif
        
        template <class T>
        using is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;
        
        template <class T>
        using is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;
        
        template <class T> using to_unsigned_t = typename to_unsigned<T>::type;
        
    }  // namespace internal
    
}  // namespace atcoder

#include <cassert>
#include <numeric>
#include <type_traits>

#ifdef _MSC_VER
#include <intrin.h>
#endif

namespace atcoder {
    
    namespace internal {
        
        struct modint_base {};
        struct static_modint_base : modint_base {};
        
        template <class T> using is_modint = std::is_base_of<modint_base, T>;
        template <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;
        
    }  // namespace internal
    
    template <int m, std::enable_if_t<(1 <= m)>* = nullptr>
    struct static_modint : internal::static_modint_base {
        using mint = static_modint;
        
    public:
        static constexpr int mod() { return m; }
        static mint raw(int v) {
            mint x;
            x._v = v;
            return x;
        }
        
        static_modint() : _v(0) {}
        template <class T, internal::is_signed_int_t<T>* = nullptr>
        static_modint(T v) {
            long long x = (long long)(v % (long long)(umod()));
            if (x < 0) x += umod();
            _v = (unsigned int)(x);
        }
        template <class T, internal::is_unsigned_int_t<T>* = nullptr>
        static_modint(T v) {
            _v = (unsigned int)(v % umod());
        }
        static_modint(bool v) { _v = ((unsigned int)(v) % umod()); }
        
        unsigned int val() const { return _v; }
        
        mint& operator++() {
            _v++;
            if (_v == umod()) _v = 0;
            return *this;
        }
        mint& operator--() {
            if (_v == 0) _v = umod();
            _v--;
            return *this;
        }
        mint operator++(int) {
            mint result = *this;
            ++*this;
            return result;
        }
        mint operator--(int) {
            mint result = *this;
            --*this;
            return result;
        }
        
        mint& operator+=(const mint& rhs) {
            _v += rhs._v;
            if (_v >= umod()) _v -= umod();
            return *this;
        }
        mint& operator-=(const mint& rhs) {
            _v -= rhs._v;
            if (_v >= umod()) _v += umod();
            return *this;
        }
        mint& operator*=(const mint& rhs) {
            unsigned long long z = _v;
            z *= rhs._v;
            _v = (unsigned int)(z % umod());
            return *this;
        }
        mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }
        
        mint operator+() const { return *this; }
        mint operator-() const { return mint() - *this; }
        
        mint pow(long long n) const {
            assert(0 <= n);
            mint x = *this, r = 1;
            while (n) {
                if (n & 1) r *= x;
                x *= x;
                n >>= 1;
            }
            return r;
        }
        mint inv() const {
            if (prime) {
                assert(_v);
                return pow(umod() - 2);
            } else {
                auto eg = internal::inv_gcd(_v, m);
                assert(eg.first == 1);
                return eg.second;
            }
        }
        
        friend mint operator+(const mint& lhs, const mint& rhs) {
            return mint(lhs) += rhs;
        }
        friend mint operator-(const mint& lhs, const mint& rhs) {
            return mint(lhs) -= rhs;
        }
        friend mint operator*(const mint& lhs, const mint& rhs) {
            return mint(lhs) *= rhs;
        }
        friend mint operator/(const mint& lhs, const mint& rhs) {
            return mint(lhs) /= rhs;
        }
        friend bool operator==(const mint& lhs, const mint& rhs) {
            return lhs._v == rhs._v;
        }
        friend bool operator!=(const mint& lhs, const mint& rhs) {
            return lhs._v != rhs._v;
        }
        
    private:
        unsigned int _v;
        static constexpr unsigned int umod() { return m; }
        static constexpr bool prime = internal::is_prime<m>;
    };
    
    template <int id> struct dynamic_modint : internal::modint_base {
        using mint = dynamic_modint;
        
    public:
        static int mod() { return (int)(bt.umod()); }
        static void set_mod(int m) {
            assert(1 <= m);
            bt = internal::barrett(m);
        }
        static mint raw(int v) {
            mint x;
            x._v = v;
            return x;
        }
        
        dynamic_modint() : _v(0) {}
        template <class T, internal::is_signed_int_t<T>* = nullptr>
        dynamic_modint(T v) {
            long long x = (long long)(v % (long long)(mod()));
            if (x < 0) x += mod();
            _v = (unsigned int)(x);
        }
        template <class T, internal::is_unsigned_int_t<T>* = nullptr>
        dynamic_modint(T v) {
            _v = (unsigned int)(v % mod());
        }
        dynamic_modint(bool v) { _v = ((unsigned int)(v) % mod()); }
        
        unsigned int val() const { return _v; }
        
        mint& operator++() {
            _v++;
            if (_v == umod()) _v = 0;
            return *this;
        }
        mint& operator--() {
            if (_v == 0) _v = umod();
            _v--;
            return *this;
        }
        mint operator++(int) {
            mint result = *this;
            ++*this;
            return result;
        }
        mint operator--(int) {
            mint result = *this;
            --*this;
            return result;
        }
        
        mint& operator+=(const mint& rhs) {
            _v += rhs._v;
            if (_v >= umod()) _v -= umod();
            return *this;
        }
        mint& operator-=(const mint& rhs) {
            _v += mod() - rhs._v;
            if (_v >= umod()) _v -= umod();
            return *this;
        }
        mint& operator*=(const mint& rhs) {
            _v = bt.mul(_v, rhs._v);
            return *this;
        }
        mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }
        
        mint operator+() const { return *this; }
        mint operator-() const { return mint() - *this; }
        
        mint pow(long long n) const {
            assert(0 <= n);
            mint x = *this, r = 1;
            while (n) {
                if (n & 1) r *= x;
                x *= x;
                n >>= 1;
            }
            return r;
        }
        mint inv() const {
            auto eg = internal::inv_gcd(_v, mod());
            assert(eg.first == 1);
            return eg.second;
        }
        
        friend mint operator+(const mint& lhs, const mint& rhs) {
            return mint(lhs) += rhs;
        }
        friend mint operator-(const mint& lhs, const mint& rhs) {
            return mint(lhs) -= rhs;
        }
        friend mint operator*(const mint& lhs, const mint& rhs) {
            return mint(lhs) *= rhs;
        }
        friend mint operator/(const mint& lhs, const mint& rhs) {
            return mint(lhs) /= rhs;
        }
        friend bool operator==(const mint& lhs, const mint& rhs) {
            return lhs._v == rhs._v;
        }
        friend bool operator!=(const mint& lhs, const mint& rhs) {
            return lhs._v != rhs._v;
        }
        
    private:
        unsigned int _v;
        static internal::barrett bt;
        static unsigned int umod() { return bt.umod(); }
    };
    template <int id> internal::barrett dynamic_modint<id>::bt = 998244353;
    
    using modint998244353 = static_modint<998244353>;
    using modint1000000007 = static_modint<1000000007>;
    using modint = dynamic_modint<-1>;
    
    namespace internal {
        
        template <class T>
        using is_static_modint = std::is_base_of<internal::static_modint_base, T>;
        
        template <class T>
        using is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;
        
        template <class> struct is_dynamic_modint : public std::false_type {};
        template <int id>
        struct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};
        
        template <class T>
        using is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;
        
    }  // namespace internal
    
}  // namespace atcoder

#include <cassert>
#include <type_traits>
#include <vector>

namespace atcoder {
    
    namespace internal {
        
        template <class mint, internal::is_static_modint_t<mint>* = nullptr>
        void butterfly(std::vector<mint>& a) {
            static constexpr int g = internal::primitive_root<mint::mod()>;
            int n = int(a.size());
            int h = internal::ceil_pow2(n);
            
            static bool first = true;
            static mint sum_e[30];  // sum_e[i] = ies[0] * ... * ies[i - 1] * es[i]
            if (first) {
                first = false;
                mint es[30], ies[30];  // es[i]^(2^(2+i)) == 1
                int cnt2 = bsf(mint::mod() - 1);
                mint e = mint(g).pow((mint::mod() - 1) >> cnt2), ie = e.inv();
                for (int i = cnt2; i >= 2; i--) {
                    es[i - 2] = e;
                    ies[i - 2] = ie;
                    e *= e;
                    ie *= ie;
                }
                mint now = 1;
                for (int i = 0; i < cnt2 - 2; i++) {
                    sum_e[i] = es[i] * now;
                    now *= ies[i];
                }
            }
            for (int ph = 1; ph <= h; ph++) {
                int w = 1 << (ph - 1), p = 1 << (h - ph);
                mint now = 1;
                for (int s = 0; s < w; s++) {
                    int offset = s << (h - ph + 1);
                    for (int i = 0; i < p; i++) {
                        auto l = a[i + offset];
                        auto r = a[i + offset + p] * now;
                        a[i + offset] = l + r;
                        a[i + offset + p] = l - r;
                    }
                    now *= sum_e[bsf(~(unsigned int)(s))];
                }
            }
        }
        
        template <class mint, internal::is_static_modint_t<mint>* = nullptr>
        void butterfly_inv(std::vector<mint>& a) {
            static constexpr int g = internal::primitive_root<mint::mod()>;
            int n = int(a.size());
            int h = internal::ceil_pow2(n);
            
            static bool first = true;
            static mint sum_ie[30];  // sum_ie[i] = es[0] * ... * es[i - 1] * ies[i]
            if (first) {
                first = false;
                mint es[30], ies[30];  // es[i]^(2^(2+i)) == 1
                int cnt2 = bsf(mint::mod() - 1);
                mint e = mint(g).pow((mint::mod() - 1) >> cnt2), ie = e.inv();
                for (int i = cnt2; i >= 2; i--) {
                    es[i - 2] = e;
                    ies[i - 2] = ie;
                    e *= e;
                    ie *= ie;
                }
                mint now = 1;
                for (int i = 0; i < cnt2 - 2; i++) {
                    sum_ie[i] = ies[i] * now;
                    now *= es[i];
                }
            }
            
            for (int ph = h; ph >= 1; ph--) {
                int w = 1 << (ph - 1), p = 1 << (h - ph);
                mint inow = 1;
                for (int s = 0; s < w; s++) {
                    int offset = s << (h - ph + 1);
                    for (int i = 0; i < p; i++) {
                        auto l = a[i + offset];
                        auto r = a[i + offset + p];
                        a[i + offset] = l + r;
                        a[i + offset + p] =
                        (unsigned long long)(mint::mod() + l.val() - r.val()) *
                        inow.val();
                    }
                    inow *= sum_ie[bsf(~(unsigned int)(s))];
                }
            }
        }
        
    }  // namespace internal
    
    template <class mint, internal::is_static_modint_t<mint>* = nullptr>
    std::vector<mint> convolution(std::vector<mint> a, std::vector<mint> b) {
        int n = int(a.size()), m = int(b.size());
        if (!n || !m) return {};
        if (std::min(n, m) <= 60) {
            if (n < m) {
                std::swap(n, m);
                std::swap(a, b);
            }
            std::vector<mint> ans(n + m - 1);
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    ans[i + j] += a[i] * b[j];
                }
            }
            return ans;
        }
        int z = 1 << internal::ceil_pow2(n + m - 1);
        a.resize(z);
        internal::butterfly(a);
        b.resize(z);
        internal::butterfly(b);
        for (int i = 0; i < z; i++) {
            a[i] *= b[i];
        }
        internal::butterfly_inv(a);
        a.resize(n + m - 1);
        mint iz = mint(z).inv();
        for (int i = 0; i < n + m - 1; i++) a[i] *= iz;
        return a;
    }
    
    template <unsigned int mod = 998244353,
    class T,
    std::enable_if_t<internal::is_integral<T>::value>* = nullptr>
    std::vector<T> convolution(const std::vector<T>& a, const std::vector<T>& b) {
        int n = int(a.size()), m = int(b.size());
        if (!n || !m) return {};
        
        using mint = static_modint<mod>;
        std::vector<mint> a2(n), b2(m);
        for (int i = 0; i < n; i++) {
            a2[i] = mint(a[i]);
        }
        for (int i = 0; i < m; i++) {
            b2[i] = mint(b[i]);
        }
        auto c2 = convolution(move(a2), move(b2));
        std::vector<T> c(n + m - 1);
        for (int i = 0; i < n + m - 1; i++) {
            c[i] = c2[i].val();
        }
        return c;
    }
    
    std::vector<long long> convolution_ll(const std::vector<long long>& a,
                                          const std::vector<long long>& b) {
        int n = int(a.size()), m = int(b.size());
        if (!n || !m) return {};
        
        static constexpr unsigned long long MOD1 = 754974721;  // 2^24
        static constexpr unsigned long long MOD2 = 167772161;  // 2^25
        static constexpr unsigned long long MOD3 = 469762049;  // 2^26
        static constexpr unsigned long long M2M3 = MOD2 * MOD3;
        static constexpr unsigned long long M1M3 = MOD1 * MOD3;
        static constexpr unsigned long long M1M2 = MOD1 * MOD2;
        static constexpr unsigned long long M1M2M3 = MOD1 * MOD2 * MOD3;
        
        static constexpr unsigned long long i1 =
        internal::inv_gcd(MOD2 * MOD3, MOD1).second;
        static constexpr unsigned long long i2 =
        internal::inv_gcd(MOD1 * MOD3, MOD2).second;
        static constexpr unsigned long long i3 =
        internal::inv_gcd(MOD1 * MOD2, MOD3).second;
        
        auto c1 = convolution<MOD1>(a, b);
        auto c2 = convolution<MOD2>(a, b);
        auto c3 = convolution<MOD3>(a, b);
        
        std::vector<long long> c(n + m - 1);
        for (int i = 0; i < n + m - 1; i++) {
            unsigned long long x = 0;
            x += (c1[i] * i1) % MOD1 * M2M3;
            x += (c2[i] * i2) % MOD2 * M1M3;
            x += (c3[i] * i3) % MOD3 * M1M2;
            long long diff =
            c1[i] - internal::safe_mod((long long)(x), (long long)(MOD1));
            if (diff < 0) diff += MOD1;
            static constexpr unsigned long long offset[5] = {
                0, 0, M1M2M3, 2 * M1M2M3, 3 * M1M2M3};
            x -= offset[diff % 5];
            c[i] = x;
        }
        
        return c;
    }
    
}  // namespace atcoder

using mint=atcoder::modint998244353;

vector<mint> prebat(vector<mint> S,int szsum){
    int z = 1 << atcoder::internal::ceil_pow2(szsum-1);
    auto res=S;
    res.resize(z);
    atcoder::internal::butterfly(res);
    return res;
}
// szsum = aの配列の長さ + bの配列の長さ

vector<mint> sufbat(vector<mint> S,int szsum){
    int z = 1 << atcoder::internal::ceil_pow2(szsum-1);
    auto res=S;
    atcoder::internal::butterfly_inv(res);
    res.resize(szsum-1);
    mint iz = mint(z).inv();
    for (int i = 0; i < szsum - 1; i++) res[i] *= iz;
    return res;
}
// szsum = aの配列の長さ + bの配列の長さ

mint inv[MAX],fac[MAX],finv[MAX];

void make(){
    
    fac[0]=fac[1]=1;
    finv[0]=finv[1]=1;
    inv[1]=1;
    
    for(int i=2;i<MAX;i++){
        inv[i]=-inv[mod%i]*(mod/i);
        fac[i]=fac[i-1]*i;
        finv[i]=finv[i-1]*inv[i];
    }
}

mint comb(ll a,ll b){
    if(a<b) return 0;
    return fac[a]*finv[b]*finv[a-b];
}

mint perm(ll a,ll b){
    if(a<b) return 0;
    return fac[a]*finv[a-b];
}

vector<mint> bibun(vector<mint> F,int deg){
    vector<mint> res(deg+1);
    for(int i=1;i<si(F)&&i-1<=deg;i++){
        res[i-1]=F[i]*i;
    }
    
    return res;
}

vector<mint> sekibun(vector<mint> F,int deg){
    vector<mint> res(deg+1);
    for(int i=0;i<min(si(F),deg);i++){
        res[i+1]=F[i]*inv[i+1];
    }
    
    return res;
}

vector<mint> invv(vector<mint> F,int deg){
    assert(F[0]!=0);
    
    mint kake=mint(F[0]).inv();
    for(int i=0;i<si(F);i++){
        F[i]*=kake;
    }
    vector<mint> G(1,1);
    int len=1;
    while(len<=deg){
        vector<mint> f=F;f.resize(len*2);
        vector<mint> g=G;g.resize(len*2);
        
        atcoder::internal::butterfly(f);
        atcoder::internal::butterfly(g);
        
        for(int i=0;i<len*2;i++) f[i]*=g[i];
        
        atcoder::internal::butterfly_inv(f);
        vector<mint> nf(len*2);
        for(int i=len;i<2*len;i++) nf[i-len]=f[i];
        
        f=nf;
        atcoder::internal::butterfly(f);
        
        for(int i=0;i<len*2;i++) f[i]*=g[i];
        
        atcoder::internal::butterfly_inv(f);
        
        mint iz=mint(len*2).inv();
        mint coe=-iz*iz;
        
        G.resize(len*2);
        
        for(int i=0;i<len;i++) G[len+i]=f[i]*coe;
        
        len*=2;
    }
    
    G.resize(deg+1);
    for(int i=0;i<=deg;i++) G[i]*=kake;
    
    return G;
}//1/Tのdeg次以下を返す

vector<mint> logg(vector<mint> F,int deg){
    assert(F[0]==1);
    
    vector<mint> FF=bibun(F,deg);
    vector<mint> waru=invv(F,deg);
    
    vector<mint> G=atcoder::convolution(FF,waru);
    
    G=sekibun(G,deg);
    
    return G;
}
// F0 = 1

vector<mint> expp(vector<mint> F,int deg){
    if(si(F)){
        assert(F[0]==0);
    }
    
    vector<mint> G(1,1);
    int len=1;
    while(len<=deg){
        vector<mint> nex=logg(G,len*2-1);
        for(int i=0;i<si(nex);i++) nex[i]*=(-1);
        for(int i=0;i<si(nex);i++){
            if(i<si(F)) nex[i]+=F[i];
        }
        nex[0]++;
        nex=atcoder::convolution(nex,G);
        nex.resize(len*2);
        
        len*=2;
        G=nex;
    }
    
    G.resize(deg+1);
    
    return G;
}
// F0 = 0

vector<mint> poww(vector<mint> F,int deg,ll K){
    if(K==0){
        vector<mint> res(deg+1);
        res[0]=1;
        return res;
    }
    if(si(F)==0){
        vector<mint> res(deg+1);
        return res;
    }
    
    ll geta=-1;
    mint kake=0;
    for(int i=0;i<si(F);i++){
        if(F[i]!=0){
            geta=i;
            kake=F[i].inv();
            break;
        }
    }
    
    if(geta==-1){
        vector<mint> res(deg+1);
        return res;
    }
    
    if(geta>1000000000LL/K){
        vector<mint> res(deg+1);
        return res;
    }
    if(geta*K>deg){
        vector<mint> res(deg+1);
        return res;
    }
    
    vector<mint> nF(si(F)-geta);
    for(int i=geta;i<si(F);i++){
        nF[i-geta]=(F[i]*kake);
    }
    
    F=nF;
    
    vector<mint> FF=logg(nF,deg-geta*K);
    for(int i=0;i<si(FF);i++) FF[i]*=K;
    
    vector<mint> G=expp(FF,deg-geta*K);
    
    kake=kake.inv();
    kake=kake.pow(K);
    
    vector<mint> res(deg+1);
    for(int i=0;i<si(G);i++){
        res[geta*K+i]=G[i]*kake;
    }
    
    return res;
}

mint senkeizenka(vector<mint> A,vector<mint> C,ll K){
    if(K<si(A)) return A[K];
    
    int D=si(A);
    assert(si(A)==si(C));
    vector<mint> Q(D+1);
    Q[0]=1;
    for(int i=1;i<=D;i++) Q[i]=-C[i-1];
    
    auto P=atcoder::convolution(A,Q);
    P.resize(D);
    
    while(K){
        auto Qneg=Q;
        for(int i=1;i<si(Qneg);i+=2) Qneg[i]=-Qneg[i];
        auto x=atcoder::convolution(P,Qneg);
        auto y=atcoder::convolution(Q,Qneg);
        
        P.clear();
        Q.clear();
        for(int i=(K&1);i<si(x);i+=2) P.push_back(x[i]);
        for(int i=0;i<si(y);i+=2) Q.push_back(y[i]);
        K/=2;
    }
    
    return P[0]/Q[0];
}
//a[0],...,a[d-1]
//c[1],...,c[d]

mint senkeizenka2(vector<mint> P,vector<mint> Q,ll K){
    
    while(K){
        auto Qneg=Q;
        for(int i=1;i<si(Qneg);i+=2) Qneg[i]=-Qneg[i];
        auto x=atcoder::convolution(P,Qneg);
        auto y=atcoder::convolution(Q,Qneg);
        
        P.clear();
        Q.clear();
        for(int i=(K&1);i<si(x);i+=2) P.push_back(x[i]);
        for(int i=0;i<si(y);i+=2) Q.push_back(y[i]);
        K/=2;
    }
    
    return P[0]/Q[0];
}
// P/Q

// make() を呼ばないとsekibun呼ぶやつで一部バグる
// MAX=2*deg ぐらい必要な気がする

pair<vector<mint>,vector<mint>> warizan(vector<mint> P,vector<mint> Q){
    if(si(P)<si(Q)) return mp(vector<mint>{},P);
    
    auto revP=P;reverse(all(revP));
    auto revQ=Q;reverse(all(revQ));
    revQ=invv(revQ,si(P)-si(Q));
    auto shou=atcoder::convolution(revP,revQ);
    shou.resize(si(P)-si(Q)+1);
    reverse(all(shou));
    
    auto hiku=atcoder::convolution(Q,shou);
    
    vector<mint> amari(si(P));
    for(int i=0;i<si(P);i++){
        amari[i]=P[i]-hiku[i];
    }
    while(si(shou)&&shou.back()==0) shou.pop_back();
    while(si(amari)&&amari.back()==0) amari.pop_back();
    return mp(shou,amari);
}
// 最高位が0でないようにしている(0のときは空)
// 多項式での除算

vector<mint> multieval(vector<mint> P,vector<mint> que){
    if(si(que)==0) return {};
    int N=si(que),n=1;
    while(n<N) n*=2;
    que.resize(n);
    
    vector<vector<mint>> Atree(n+n-1),Btree(n+n-1);
    for(int i=0;i<n;i++) Atree[n-1+i]={-que[i],1};
    for(int i=n-2;i>=0;i--){
        Atree[i]=atcoder::convolution(Atree[2*i+1],Atree[2*i+2]);
    }
    
    Btree[0]=warizan(P,Atree[0]).se;
    for(int i=1;i<n+n-1;i++){
        Btree[i]=warizan(Btree[(i-1)/2],Atree[i]).se;
    }
    
    vector<mint> res(N,0);
    for(int i=0;i<N;i++){
        if(si(Btree[n-1+i])) res[i]=Btree[n-1+i][0];
    }
    
    return res;
}

vector<mint> multieval_touhi(vector<mint> P,mint w,int M){
    if(M==0) return {};
    
    int N=si(P);
    
    if(N==0) return vector<mint>(M,0);
    
    if(w==0){
        vector<mint> res(M,P[0]);
        res[0]=0;
        for(int i=0;i<N;i++) res[0]+=P[i];
        return res;
    }
    
    vector<mint> y(N),v(N+M-1);
    for(ll i=0;i<N;i++) y[i]=P[i]/w.pow(i*(i-1)/2);
    for(ll i=0;i<N+M-1;i++) v[i]=w.pow(i*(i-1)/2);
    
    reverse(all(y));
    
    auto z=atcoder::convolution(y,v);
    
    vector<mint> res(M);
    
    for(ll i=0;i<M;i++){
        res[i]=z[N-1+i]/w.pow(i*(i-1)/2);
    }
    
    return res;
}
// w^0,...,w^(M-1)まで答える
// 0^0=1

vector<mint> Bernoulli(int N){
    vector<mint> F(N+1);
    for(int i=0;i<=N;i++) F[i]=finv[i+1];
    F=invv(F,N);
    
    for(int i=0;i<=N;i++){
        F[i]*=fac[i];
    }
    return F;
}

vector<mint> Taylor_Shift(vector<mint> F,ll c){
    int N=si(F);
    vector<mint> A(N),B(N);
    for(int i=0;i<N;i++){
        A[i]=F[N-1-i]*fac[N-1-i];
        B[i]=finv[i]*mint(c).pow(i);
    }
    
    vector<mint> p=atcoder::convolution(A,B);
    
    for(int i=0;i<N;i++) p[i]*=finv[N-1-i];
    
    vector<mint> res(N);
    
    for(int i=0;i<N;i++) res[i]=p[N-1-i];
    
    return res;
}

vector<mint> manyproduct(vector<vector<mint>> S){
    deque<vector<mint>> deq;
    for(auto a:S) deq.push_back(a);
    while(si(deq)>1){
        auto a=deq.front();deq.pop_front();
        auto b=deq.front();deq.pop_front();
        deq.push_back(atcoder::convolution(a,b));
    }
    return deq[0];
}

vector<mint> Be;

vector<mint> PrefixSum(vector<mint> p){
    int N=si(p);
    vector<mint> f(N);
    for(int i=1;i<N;i++) f[i]=p[i]*fac[i];
    
    vector<mint> g(N);
    for(int j=0;j<N;j++) g[j]=Be[j]*finv[j];
    reverse(all(g));
    
    auto h=atcoder::convolution(f,g);
    
    vector<mint> res(N+1);
    for(int i=1;i<=N;i++){
        res[i]=h[N-2+i]*finv[i];
    }
    
    res[0]+=p[0];
    res[1]+=p[0];
    
    return res;
}

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    make();
    
    Be=Bernoulli(3005);
    Be[1]=-Be[1];
    
    ll N;cin>>N;
    vector<ll> B(N-1);
    for(int i=0;i<N-1;i++){
        cin>>B[i];
    }
    
    bigint M;cin>>M;
    
    vector<mint> F={1};
    for(int i=0;i<si(B);i++){
        ll amari=M%B[i];
        
        F=Taylor_Shift(F,amari);
        for(int j=0;j<si(F);j++) F[j]*=mint(B[i]).pow(j);
        
        F=PrefixSum(F);
        
        M/=B[i];
    }
    
    mint ans=0;
    ll m=M%mod;
    for(int i=0;i<si(F);i++){
        ans+=F[i]*mint(m).pow(i);
    }
    
    cout<<ans.val()<<endl;
}