#include<bits/stdc++.h>

using namespace std;

namespace strhash {
    using u64 = uint64_t;
    mt19937_64 rng(random_device{}());
    const int base = 135 + rng() % 114514;
    constexpr int p1 = 1'0000'0000'7, p2 = 1'0000'0000'9;
    constexpr unsigned msk32 = ~(0u);

    vector<u64> pw1{1}, pw2{1};

    class StringHash {
        vector<u64> h;
        int n;
    public:
        StringHash(const string &s) : n(s.length()) {
            int old_size = pw1.size();
            if (old_size < n + 1) {
                pw1.resize(2 * n + 1, 1), pw2.resize(2 * n + 1, 1);
                for (int i = old_size; i <= 2 * n; i++) {
                    pw1[i] = pw1[i - 1] * base % p1;
                    pw2[i] = pw2[i - 1] * base % p2;
                }
            }
            u64 now1 = 0, now2 = 0;
            h.resize(n + 1, 0);
            for (int i = n - 1; i >= 0; i--) {
                now1 = (now1 * base + s[i]) % p1;
                now2 = (now2 * base + s[i]) % p2;
                h[i] = (now1 << 32) | now2;
            }
        }
        u64 get(int l, int r) {
            int len = r - l;
            u64 l1 = h[l] >> 32, r1 = h[r] >> 32;
            u64 l2 = h[l] & msk32, r2 = h[r] & msk32;
            u64 res1 = (l1 - r1 * pw1[len] % p1 + p1) % p1;
            u64 res2 = (l2 - r2 * pw2[len] % p2 + p2) % p2;
            return (res1 << 32) | res2;
        }
    };

}  // namespace strhash
using namespace strhash;
#define int ll
#define ll unsigned long long

const int mod = 998244353;
#define irep(i,l,r) for(int i = l; i <= r; ++ i)

vector<int>stlen;

ll f[1000000 + 7] = {1};
signed main(){
    ios::sync_with_stdio(false), cin.tie(0);
    string s;
    cin >> s;
    int n;
    cin >> n;
    vector<ll>v(n);
    vector<string>a(n);
    map<ll, int>h;
    irep(i, 0, n - 1){
        cin >> a[i] >> v[i];
        stlen.push_back(a[i].length());
    }
    sort(stlen.begin(), stlen.end());
    stlen.erase(unique(stlen.begin(), stlen.end()), stlen.end());
    StringHash H(s);
    irep(i, 0, n - 1){
        StringHash T(a[i]);
        h[T.get(0, a[i].length())] = i;
    }
//    irep(i, 0, n)f[i] = 1;
int m = s.length();
    irep(i, 0, m - 1){
        f[i + 1] += f[i];
        for(int len : stlen){
            int j = i + len;
            if(j > m)continue;
            auto it = h.find(H.get(i, j));
            if(it != h.end()){
                int idx = it->second;
                f[j] += f[i] * v[idx] % mod;
                f[j] %= mod;
            }
        }
        f[i] %= mod;
    }
    irep(i, 1, m){
        cout << f[i] % mod << ' ';
    }
    return 0;
}