#include <atcoder/modint>
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using mint = atcoder::modint998244353;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

void solve() {
  string s, t;
  cin >> s >> t;
  ll n = s.size(), m = t.size();
  vector<mint> dp(m + 10, 0);
  dp[0] = 1;
  rep(i, n) {
    for (ll j = m; j >= 0; j--) {
      if (j < m && s[i] == t[j]) {
        dp[j + 1] += dp[j];
      }
      dp[j] *= 2;
    }
  }
  cout << dp[m].val() << '\n';
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}