#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	string s, t; cin >> s >> t;
	vector<mint>dp(t.size() + 1);
	dp[0] = 1;
	vector<vector<int>>pos(26);
	rep(i, t.size())pos[t[i] - 'a'].push_back(i);
	rep(i, 26)reverse(all(pos[i]));
	rep(i, s.size()) {
		int idx = s[i] - 'a';
		for (auto e : pos[idx]) {
			dp[e + 1] += dp[e];
		}
	}
	mint ans = dp.back();
	ans *= pow_mod(2, s.size() - t.size(), mod);
	cout << ans.val() << endl;
	return 0;
}