#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
    string S,T;
    cin>>S>>T;
    int N = S.size();
    int M = T.size();
    int mod = 998244353;
    vector<int> dp(M+1);
    dp[0] = 1;
    for(int i=0;i<N;i++)for(int j=M-1;j>=0;j--)if(S[i] == T[j]) dp[j+1] = (dp[j+1]+dp[j])%mod;
    int ans = dp[M];
    for(int i=0;i<N-M;i++) ans = (ans*2)%mod;
    cout<<ans<<endl;
}