#include <bits/stdc++.h>
using namespace std;
using i64 = unsigned long long;

inline int val(char ch) {return ch - 'a' + 1;}

constexpr int N = 1e6 + 10;
int r[N];
int f[N], g[N], w[N], sf[N], sg[N], sw[N];

static constexpr int mod = 998244353;
inline int add(int x, int y) {return (x + y >= mod ? x + y - mod : x + y);}
inline int dec(int x, int y) {return (x - y < 0 ? x - y + mod : x - y);}
inline void ad(int &x, int y) {x = add(x, y);}
inline void de(int &x, int y) {x = dec(x, y);}

constexpr i64 P = 1004535809, P2 = 1145141;
string s, t; i64 S[N], T[N], S2[N], T2[N], pr[N], pr2[N]; int n, m;

inline int lcp(int x, int y) {
	assert(x >= y);
	int l = 0, r = min(n - x + 1, m - y + 1), res = 0;
	while(l <= r) {
		int M = l + r >> 1; int f = 1;
		i64 B = mod + T[y + M - 1] - (y == 0 ? 0 : T[y - 1]); B %= mod;
		i64 A = mod + S[x + M - 1] - (x == 0 ? 0 : S[x - 1]); A %= mod;
		f &= B * pr[x - y] % mod == A;
		
		B = P + T2[y + M - 1] - (y == 0 ? 0 : T2[y - 1]); B %= P;
		A = P + S2[x + M - 1] - (x == 0 ? 0 : S2[x - 1]); A %= P;
		f &= B * pr2[x - y] % P == A;
		if(f) {
			res = M;
			l = M + 1;
		} else {
			r = M - 1;
		}
	}
	return res;
}

int main() {
	ios::sync_with_stdio(false); 
	cin.tie(nullptr); cout.tie(nullptr);
	
	cin >> s >> t; n = s.size(), m = t.size();
	pr[0] = 1, pr2[0] = 1;
	for(int i = 1; i <= n; i++) {
		pr[i] = pr[i - 1] * P2 % mod;
		pr2[i] = pr2[i - 1] * P2 % P;
	}
	S[0] = S2[0] = val(s[0]), T[0] = T2[0] = val(t[0]);
	for(int i = 1; i < n; i++) {
		S[i] = S[i - 1] + val(s[i]) * pr[i];
		S[i] %= mod;
		S2[i] = S2[i - 1] + val(s[i]) * pr2[i];
		S2[i] %= P;
	}
	for(int i = 1; i < m; i++) {
		T[i] = T[i - 1] + val(t[i]) * pr[i];
		T[i] %= mod;
		T2[i] = T2[i - 1] + val(t[i]) * pr2[i];
		T2[i] %= P;
	}

	for(int i = 0; i < n; i++) {
		int L = lcp(i, 0);
		r[i] = i + L - 1;
		if(r[i] == n - 1) {
			continue;
		}
		if(r[i] == n - 2) {
			r[i] = n - 1;
			continue;
		}
		r[i] = r[i] + 2 + lcp(r[i] + 2, L + 1) - 1;
	}
	for(int i = 0; i < n; i++) {
		r[i] = min(r[i], i + m - 1);
	}
	// for(int i = 0; i < n; i++) {
	// 	int dif = 0;
	// 	for(int j = i; j < n && j - i < t.size(); j++) {
	// 		dif += (s[j] != t[j - i]);
	// 		if(dif >= 2) {
	// 			break;
	// 		}
	// 		r[i] = j;
	// 	}
	// }
	w[n] = 1; sw[n] = 1;
	for(int i = n - 1; i >= 0; i--) {
		ad(f[i], dec(sf[i + 1], sf[r[i] + 2]));
		ad(f[i], 2ll * dec(sg[i + 1], sg[r[i] + 2]) % mod);
		ad(f[i], dec(sw[i + 1], sw[r[i] + 2]));

		ad(g[i], dec(sg[i + 1], sg[r[i] + 2]));
		ad(g[i], dec(sw[i + 1], sw[r[i] + 2]));

		ad(w[i], dec(sw[i + 1], sw[r[i] + 2]));

		sf[i] = add(sf[i + 1], f[i]);
		sg[i] = add(sg[i + 1], g[i]);
		sw[i] = add(sw[i + 1], w[i]);
	}
	cout << f[0] << "\n";
}
/*
Author: chroneZ
Start thinking at 
Start coding at 
Finish debugging at 
*/