#include <atcoder/all>
#include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
using namespace atcoder;
using namespace std;

typedef long long ll;

using mint = modint998244353;

int main() {
    string s, t;
    cin >> s >> t;
    int n = s.size(), m = t.size();
    vector<mint> dp(m + 1), prev_dp(m + 1);
    dp[0] = 1;
    rep(i, 0, n) {
        prev_dp = dp;
        rep(j, 0, m + 1) {
            dp[j] = prev_dp[j];
            if (j > 0 && s[i] == t[j - 1]) {
                dp[j] += prev_dp[j - 1];
            }
        }
    }

    mint cnt = dp[m];
    int delta = n - m;
    mint ans = cnt * mint(2).pow(delta);
    cout << ans.val() << endl;
}