#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int mod = 998244353;

int get_r(const string s, const string t, int i){
    int res = 0, mis = 0;
    while(i+res < s.length() && res < t.length() && (s[i+res] == t[res] || mis == 0)){
        if(s[i+res] != t[res]) mis++;
        res++;
    }
    return i+res;
}

int main(){

    string s, t;
    cin >> s >> t;

    int n = s.length(), m = t.length();

    vector<int> dp[3];
    dp[0].resize(n+1, 0);
    dp[1] = dp[2] = dp[0];

    dp[2][n] = 0;
    dp[1][n] = 0;
    dp[0][n] = 1;

    for(int i = n-1; i >= 0; i--){
        int r = get_r(s, t, i);
        assert(r != i);

        for(int j = i; j < r; j++){
            dp[0][i] += dp[0][j+1];
            dp[0][i] %= mod;
        }

        for(int j = i; j < r; j++){
            dp[1][i] += (dp[0][j+1] + dp[1][j+1])%mod;
            dp[1][i] %= mod;
        }

        for(int j = i; j < r; j++){
            dp[2][i] += (dp[1][j+1] + dp[2][j+1])%mod;
            dp[2][i] %= mod;
        }

    }

    cout << (dp[2][0]*2%mod + dp[1][0])%mod;

    return 0;
}

/*

n^2 = 2*choose(n, 2) + choose(n, 1)
choose(n, 2) = choose(n-1, 1) + choose(n-1, 2)

*/