#include <bits/stdc++.h>
using namespace std;

using ll = long long;
constexpr int mod = 998244353, inv2 = (mod + 1) / 2;

int main(void) {
	string S, T;
	cin >> S >> T;
	
	int N = S.size(), M = T.size();
	
	vector<ll> dp(M + 1, 0);
	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;
	
	ll p2 = 1;
	for(int i = 0; i < N - M; ++i) p2 = (p2 * 2) % mod;
	
	cout << dp[M] * p2 % mod << "\n";
	
	return 0;
}