#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 10;
const ll INFL = 4e18;

#include <atcoder/modint>
using mint = atcoder::modint998244353;

int main() {
    string S, T;
    cin >> S >> T;
    int N = ssize(S), M = ssize(T);

    vector<vector<mint>> dp(N + 1, vector<mint>(M + 1));
    dp[0][0] = 1;
    for (int i = 0; i < N; i++) {
        for (int j = 0; j <= M; j++) {
            dp[i + 1][j] += dp[i][j];
            if (S[i] == T[j] && j < M) {
                dp[i + 1][j + 1] += dp[i][j];
            }
        }
    }

    mint ans = dp.back().back();
    ans *= mint(2).pow(N - M);
    cout << ans.val() << endl;
}