#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
typedef long long ll;
using namespace std;
constexpr int N=2e5+5,M=N*10,mod=998244353;
int n,ans[N],jump[M],val[M],f[N],slen[M],sum[N];
bool tag[M];
char s[N],t[N];
struct acnode{
    int fail,son[26];
    acnode(){memset(son,0,sizeof son);}
}tr[M];
int tot=1;
inline void ins(char*s,int v){
    int u=1,n=strlen(s+1);
    rep(i,1,n){
        if(!tr[u].son[s[i]-'a'])tr[u].son[s[i]-'a']=++tot;
        u=tr[u].son[s[i]-'a'];
    }
//    printf("tag: true u = %d\n", u);
    tag[u]=true,val[u]=v,slen[u]=n;
}
queue<int>q;
inline void getfail(){
    rep(i,0,25)tr[0].son[i]=1;
	q.push(1),tr[1].fail=0;
	while(!q.empty()){
		int u=q.front();q.pop();
        rep(i,0,25){
			int v=tr[u].son[i],Fail=tr[u].fail;
			if(!v){tr[u].son[i]=tr[Fail].son[i];continue;}
			tr[v].fail=tr[Fail].son[i],q.push(v);
		}
	}
}
bool vis[M];
inline int getjump(int x){
	if (!x) return 0;
    if (vis[x]) return jump[x];
    if(tag[tr[x].fail]) jump[x]=tr[x].fail;
    else jump[x]=getjump(tr[x].fail);
    return vis[x]=1,jump[x];
}
int main(){
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    cin>>s+1;
    cin>>n;
    rep(i,1,n){
        int v;
        cin>>t+1>>v;
        int m=strlen(t+1);
        ins(t,v);
    }
    getfail();
    rep(i,1,tot)jump[i]=getjump(i);
//    printf("tot=%d\n", tot);
//    rep(i,1,tot) printf("%d ",tr[i].fail); puts("");
//    rep(i,1,tot) printf("%d ",jump[i]); puts("");
    int len=strlen(s+1),u=1;
    auto add=[&](int&x,int y){x+=y;if(x>=mod)x-=mod;};
    rep(i,1,len){
        u=tr[u].son[s[i]-'a'];
//        printf("u=%d\n", u);
        for(int v=tag[u]?u:jump[u];v;v=jump[v])
            add(f[i],(long long)(sum[i-slen[v]]+1)*val[v]%mod);
        // ans[i]=((ll)ans[i-1]+f[i]-1+mod)%mod;
        sum[i]=(sum[i-1]+f[i])%mod;
        cout<<(sum[i]+1)%mod<<' ';
    }
    return 0;
}
/*
qfmyqqfmyqqfmyq
2
qfmyq 111111
myqq 404968002
*/