#include<bits/stdc++.h>
using namespace std;
#define N 209
#define mod 998244353
#define int long long
inline int read()
{
    register int x=0;
    register char ch=cin.get();
    register bool op=0;
    while(!isdigit(ch)) {if(ch=='-')op=1;ch=cin.get();}
    while(isdigit(ch)) {(x*=10)+=(ch^48);ch=cin.get();}
    return op? -x:x;
}
inline int qpow(register int base,register int power)
{
    long long res=1;
    while (power)
    {
        if(power&1) res=1ll*res*base%mod;
        power>>=1;
        base=1ll*base*base%mod;
    }
    return res%mod;
}
long long inv[N];
long long a[N];
long long f[N][109]/*第i个人剩下j点血的概率*/;
long long id[N],g[N]/*任意i个人活着的概率*/,alive[N],dead[N],h[N]/*除i以外还有j个人活着的概率*/;
signed main()
{
    ios::sync_with_stdio(0);
    //freopen("4564.out","w",stdout);
    int n=read();
    for(register int i(1);i<=n;++i) inv[i]=qpow(i,mod-2);
    for(register int i(1);i<=n;++i) a[i]=read(),f[i][a[i]]=1;
    int m=read();
    for(register int k(1),op;k<=m;++k) 
    {
        op=read();
        if(op==0) 
        {
            int id=read(),u=read(),v=read();
            int p=1ll*u*qpow(v,mod-2)%mod;
            for(register int i(0);i<=a[id];++i) 
            {
                if(!i) f[id][i]=(f[id][i]+f[id][i+1]*p%mod)%mod;
                else f[id][i]=(f[id][i+1]*p%mod+1ll*f[id][i]*(1-p+mod)%mod)%mod;
            }
        }
        if(op==1) 
        {
            int k=read();
            memset(g,0,sizeof(g));g[0]=1;
            for(register int i(1);i<=k;++i) 
            {
                id[i]=read();
                alive[id[i]]=(1-f[id[i]][0]+mod)%mod;
                dead[id[i]]=f[id[i]][0];
                for(register int j(i);j>=0;--j) 
                {
                    if(!j) g[j]=g[j]*dead[id[i]]%mod;
                    else g[j]=(g[j-1]*alive[id[i]]%mod+g[j]*dead[id[i]]%mod)%mod;
                }
            }
            for(register int i(1);i<=k;++i) 
            {
                memset(h,0,sizeof(h));
                if(alive[id[i]]!=1) 
                {
                    int INV=qpow(dead[id[i]],mod-2);
                    h[0]=g[0]*INV%mod;
                    for(register int j(1);j<k;++j) 
                    h[j]=(g[j]-alive[id[i]]*h[j-1]%mod+mod)%mod*INV%mod;
                }
                else 
                {
                    for(register int j(0);j<=k;++j) 
                    h[j]=g[j+1];
                }
                long long ans=0;
                for(register int j(0);j<k;++j) 
                ans=(ans+h[j]*inv[j+1]%mod)%mod; 
                ans=ans*alive[id[i]]%mod;
                printf("%lld ",ans);
            }
            printf("\n");
        }
    }
    for(register int i(1);i<=n;++i) 
    {
        int ans=0;
        for(register int j(1);j<=a[i];++j) ans=(ans+f[i][j]*j%mod)%mod;
        printf("%d ",ans);
    }
    return 0;
}