#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using mint = atcoder::static_modint<998244353>;
// using mint = atcoder::static_modint<1000000007>;
using ld = long double;
using ll = long long;
#define mp(a,b) make_pair(a,b)
#define rep(i,s,n) for(int i=s; i<(int)n; i++)
const vector<int> dx{1,0,-1,0},dy{0,1,0,-1};

vector<mint> fps_inv(vector<mint> a,int n){
    //ab=1 (mod x^n)となるbを求める
    //実装が終わっているので遅い
    assert(a[0]!=0);
    vector<mint> p{a[0].inv()};
    int k=1;
    while(k<n){
        auto q=convolution(convolution(p,p),a);
        q.resize(k<<1);
        rep(i,0,k)q[i]=2*p[i]-q[i];
        rep(i,k,k<<1)q[i]=-q[i];
        swap(p,q);
        k<<=1;
    }
    p.resize(n);
    return p;
}

vector<mint> inverse(10000);
vector<mint> f(int k,int m,int n){
    vector<mint> out(n);
    out[0]=1;
    rep(i,1,n)out[i]=-out[i-1]*k*(m+1-i)*inverse[i];
    return out;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    rep(i,1,10000)inverse[i]=mint(i).inv();
    int n;cin >> n;
    int Q;cin >> Q;
    vector<mint> a(n);
    rep(i,0,n){
        int x;cin >> x;
        a[i]=x;
    }
    rep(q,0,Q){
        int t;cin >> t;
        if(t==1){
            int k,x;cin >> k >> x;
            auto P=f(k,x,n);
            P=fps_inv(P,n);
            a=convolution(a,P);
            a.resize(n);
        }
        else{
            int x;cin >> x;x--;
            cout << a[x].val() << "\n";
        }
    }
}