#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

template <class T>
vector<int> KMP(const T& pattern) {
  const int n = pattern.size();
  vector<int> pi(n + 1);
  pi[0] = -1;
  int border = 0;
  for (int i = 1; i < n; i++, border++) {
    const auto c = pattern[i];
    if (pattern[border] == c) {
      pi[i] = pi[border];
    } else {
      pi[i] = border;
      while (border != -1 && pattern[border] != c) {
        border = pi[border];
      }
    }
  }
  pi[n] = border;
  return pi;
}

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  string t;
  cin >> t;
  int m = t.size();
  VI kmp = KMP(t);
  vector<string> head(n), tail(n);
  vector<mint> cnt(n);
  rep(i, n) {
    string s;
    cin >> s;
    if (s[0] == '~') {
      int j, k;
      cin >> j >> k;
      j--, k--;
      cnt[i] = cnt[j] + cnt[k];
      int p = 0;
      for(char c: tail[j]) {
        while(p != -1 && t[p] != c) p = kmp[p];
        p++;
        if (p == m) p = kmp[p];
      }
      for(char c: head[k]) {
        while(p != -1 && t[p] != c) p = kmp[p];
        p++;
        if (p == m) cnt[i]++, p = kmp[p];
      }
      head[i] = head[j] + head[k];
      tail[i] = tail[j] + tail[k];
    } else {
      int p = 0;
      for(char c: s) {
        while(p != -1 && t[p] != c) p = kmp[p];
        p++;
        if (p == m) cnt[i]++, p = kmp[p];
      }
      head[i] = s;
      tail[i] = s;
    }
    if (int(head[i].size()) >= m) head[i].resize(m - 1);
    if (int(tail[i].size()) >= m) tail[i].erase(tail[i].begin(), tail[i].end() - (m - 1));
  }
  cout << cnt[n - 1].val() << '\n';
}