#include <bits/stdc++.h>
using namespace std;
#include <atcoder/modint>
using namespace atcoder;
using ll = long long;
using P = pair<ll,ll>;
#define fix(x) fixed << setprecision(x)
#define asc(x) x, vector<x>, greater<x>
#define rep(i, n) for(ll i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
constexpr ll INFLL = (1LL << 62), MOD = 998244353;
constexpr int INF = (1 << 30);
using mint = modint998244353;
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    string s,t;
    cin >> s >> t;
    vector<vector<int>> v(26);
    int n = s.size(), m = t.size();
    for(int i=m-1;i>=0;--i) v[t[i]-'a'].emplace_back(i);
    vector<mint> dp(m+1,0);
    dp[0] = 1;
    rep(i,n){
        for(int x:v[s[i]-'a']) dp[x+1] += dp[x];
    }
    mint y = 2;
    cout << (dp[m]*y.pow(n-m)).val() << '\n';
    return 0;
}