import sys
input = sys.stdin.readline

# 行列の計算（numpyを使えないとき,modを使用）
def prod(A,B,k,l,m):# A:k*l,B:l*m
    C=[[None for i in range(m)] for j in range(k)]

    for i in range(k):
        for j in range(m):
            ANS=0
            for pl in range(l):
                ANS=(ANS+A[i][pl]*B[pl][j])%mod

            C[i][j]=ANS

    return C

def plus(A,B,k,l):# a,B:k*l
    C=[[None for i in range(l)] for j in range(k)]

    for i in range(k):
        for j in range(l):
            C[i][j]=(A[i][j]+B[i][j])%mod

    return C


N,Q=map(int,input().split())
A=list(map(int,input().split()))
mod=998244353

A=[A]
for tests in range(Q):
    L=list(map(int,input().split()))

    if L[0]==2:
        x=L[1]-1

        print(A[0][x])
        continue

    k,x=L[1],L[2]

    #print(k,x)

    L=[1]
    bunshi=x
    bunbo=1

    for i in range(1,N+1):
        now=L[-1]
        L.append(now*k*bunshi*pow(bunbo,mod-2,mod)%mod)
        bunshi+=1
        bunbo+=1

    #print(L)

    X=[[0]*N for i in range(N)]

    for i in range(N):
        for j in range(N):
            if i+j<N:
                X[i][i+j]=L[j]
            else:
                break

    #print(X)

    A=prod(A,X,1,N,N)

    #print(A)