#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(0), cin.tie(0)
#define int long long
#define endl '\n'
#define M 1000000993 
#define P 1000001233 
using namespace std;

const int N = 2e6+5;
const int mod = 998244353;
int n, a[N];
int f[N];//S第i个位置向后能最大的匹配位置 
int suf1[N], suf2[N], suf3[N];
int pw1[N], pw2[N], A[N], AA[N], BB[N], B[N];
int base1 = 967, base2 = 19;
int getA(int l, int r){
	int res = A[r] - A[l-1] * pw1[r-l+1];
	res = (res%M + M) % M;
	return res;
}
int getB(int l, int r){
	int res = B[r] - B[l-1] * pw1[r-l+1];
	res = (res%M + M) % M;
	return res;
}
int getAA(int l, int r){
	int res = AA[r] - AA[l-1] * pw2[r-l+1];
	res = (res%P + P) % P;
	return res;
}
int getBB(int l, int r){
	int res = BB[r] - BB[l-1] * pw2[r-l+1];
	res = (res%P + P) % P;
	return res;
}
inline bool check(int x, int st1, int st2){
	int len = x - st1 + 1;
	if(!len) return 1;
	int u = getA(st1, x), v = getB(st2, st2 + len - 1);
	int U = getAA(st1, x), V = getBB(st2, st2 + len - 1);
	return u == v && U == V; 
}
inline void sol(){
	string S, T;
	cin >> S >> T;
	int n = S.size();
	int m = T.size();
	S = " " + S, T = " " + T;
	for(int i=1;i<=n;i++) (A[i] = A[i-1] * base1 + S[i]) %= M;
	for(int i=1;i<=n;i++) (AA[i] = AA[i-1] * base2 + S[i]) %= P;
	for(int i=1;i<=m;i++) (B[i] = B[i-1] * base1 + T[i]) %= M;
	for(int i=1;i<=m;i++) (BB[i] = BB[i-1] * base2 + T[i]) %= P;
	
	for(int i=1;i<=n;i++){
		int lo = i-1, hi = i+m-1;
		while(lo < hi){
			int mid = lo + hi + 1 >> 1;
			if(check(mid, i, 1)) lo = mid;
			else hi = mid - 1;
		}
		int can = min({lo+1, n, i+m-1}), len = can - i + 1;
		if(can <= n){
			lo = can, hi = min(n, i+m-1);
			while(lo < hi){
				int mid = lo + hi + 1 >> 1;
				if(check(mid, can+1, len+1)) lo = mid;
				else hi = mid - 1;
			}
			can = lo;
		}
		f[i] = can;
	}
	
	suf1[n+1] = 1;
	for(int i=n;i>=1;i--){
        int l = i+1, r = f[i]+1;
		(suf1[i] = (suf1[l] - suf1[r+1]) % mod) %= mod;
		(suf2[i] = (suf2[l] - suf2[r+1]) % mod + suf1[i] % mod) %= mod;
		(suf3[i] = (suf3[l] - suf3[r+1]) % mod + 2 * (suf2[l] - suf2[r+1]) % mod + (suf1[l] - suf1[r+1]) % mod) %= mod;
		(suf1[i] += suf1[i+1]) %= mod;
		(suf2[i] += suf2[i+1]) %= mod;
		(suf3[i] += suf3[i+1]) %= mod;
	}
	int ans = suf3[1] - suf3[2];
	ans = ((ans % mod) + mod) % mod;
	cout << ans << endl;
}


signed main(){
	IOS;
	int tc = 1;
	pw1[0] = pw2[0] = 1;
	for(int i=1;i<N;i++){
		pw1[i] = pw1[i-1] * base1 % M;
		pw2[i] = pw2[i-1] * base2 % P;
	}
	while(tc--){
		sol();
	}
	return 0;
}