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

using ll = long long;
#define int ll
#define all(v) (v).begin(), (v).end()
#define pb push_back

void dbg_out() { cerr << endl; }
template <typename H, typename... T>
void dbg_out(H h, T... t) { cerr << ' ' << h; dbg_out(t...); }
#define dbg(...) { cerr << #__VA_ARGS__ << ':'; dbg_out(__VA_ARGS__); }

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

const int MOD = 998244353;

int add(int a, int b){
	a += b;
	if( a >= MOD) a -= MOD;
	if(a < 0) a += MOD;
	return a;
}

int mul(int a, int b){
	int ret = (1ll*a*b)%MOD;
	return ret;
}

int pw(int a, int n){
	int ret = 1;
	while(n > 0){
		if(n&1) ret = mul(ret,a);
		a = mul(a,a);
		n = n>> 1;
	}
	return ret;
}

int inv(int a){
	return pw(a,MOD-2);
}

int gera_a(){
	int X = MOD/2;
	int L = rng();
	L %= MOD/4;
	if(L < 0) L += MOD/4;
	return X+L;
}

vector<int> process(int a, string &s, vector<int> &pwa, vector<int> &invpwa){
	int n = s.size();
	pwa[0] = 1;
	invpwa[0] = 1;
	int inva = inv(a);
	for(int i = 1; i < n; i++){
		pwa[i] = mul(pwa[i-1],a);
		invpwa[i] = mul(invpwa[i-1],inva);
	}
	vector<int> sum(n);
	for(int i = 0; i < n; i++){
		sum[i] = add(mul(int(s[i]),pwa[i]), (i ? sum[i-1] : 0));
	}
	return sum;
}

int ghash(int i, int j, vector<int> &sum, vector<int> &invpwa){
	int h = add(sum[j],-(i ? sum[i-1] : 0));
	return mul(h, invpwa[i]);
}

void z_function(vector<int> &z, string &s){
	int n = s.size();
	int L = 0, R = 0;
	for(int i = 1; i < n; i++){
		if(i > R){
			L = R = i;
			while(R < n && s[R-L] == s[R]) R++;
			z[i] = R-L; R--;
		}else{
			int k = i-L;
			if(z[k] < R-i+1) z[i] = z[k];
			else{
				L = i;
				while(R < n && s[R-L] == s[R]) R++;
				z[i] = R-L; R--;
			}
		}
	}
}

void solve() {
	string s,t;
	cin >> s >> t;
	string cn = t + "#" + s;
	int sh = t.size()+1;
	vector<int> z(cn.size());
	z_function(z,cn);
	int n = s.size();
	vector<int> r(n);
	int m = t.size();
	vector<int> pwa(cn.size());
	vector<int> invpwa(cn.size());
	int a = gera_a();
	auto sum = process(a,cn,pwa,invpwa);
	for(int i = 0; i < n; i++){
		r[i] = i+z[sh+i]-1;
		if(r[i] == n-1 || z[sh+i] == m) continue;
		r[i]++;
		if(r[i] == n-1) continue;
		int id = r[i]+1;
		int idT = id-i;
		if(idT >= m) continue;
		if(s[id] != t[idT]) continue;
		int L = id;
		int R = n-1;
		while(L < R){
			int M = (L+R+1)/2;
			int dif = M-id;
			int h1 = ghash(sh+id,sh+M,sum,invpwa);
			int h2 = ghash(idT,idT+dif,sum,invpwa);
			if(h1 == h2){
				L = M;
			}else{
				R = M-1;
			}
		}
		r[i] = L;
	}
	//dp[i] eh quantas formas de completar [i...n]
	//dp2[i] eh a soma das particoes ao completar [i...n]
	//dp2[i] = (somavou dp2[vou])dp[i]
	//dp3 ta dando errado, nao é o numero de pares? mas se ta dando 93 o numero de pares deveria aumentar muito mais que 205
	//dp3[i] eh o numero de pares ordenados ao completar [i...n]
	//dp3[i] = (somavou dp3[vou]) + 2*somavou(dp2[vou]) + dp[i] //todos os pares antes pra toda opcao, 
	//t odo o que criei com particoes antes * 2 ja que é ordenado e os pares eu+eu
	vector<int> dp(n+2);
	vector<int> sumdp(n+2);
	dp[n] = 1;
	sumdp[n] = 1;
	for(int i = n-1; i >= 0; i--){
		int b = i+1;
		int c = r[i]+1;
		//quero a soma do intervalo b a c
		dp[i] = add(dp[i],sumdp[b]);
		dp[i] = add(dp[i],-sumdp[min(c+1,n+1)]);
		sumdp[i] = add(dp[i],sumdp[i+1]);
	}
	//
	vector<int> dp2(n+2);
	vector<int> sumdp2(n+2);
	for(int i = n-1; i >= 0; i--){
		int b = i+1;
		int c = r[i]+1;
		dp2[i] = add(dp2[i],sumdp2[b]);
		dp2[i] = add(dp2[i],-sumdp2[min(c+1,n+1)]);
		dp2[i] = add(dp2[i],dp[i]);
		sumdp2[i] = add(dp2[i],sumdp2[i+1]);
	}
	vector<int> dp3(n+2);
	vector<int> sumdp3(n+2);
	for(int i = n-1; i >= 0; i--){
		int b = i+1;
		int c = r[i]+1;
		dp3[i] = add(dp3[i],sumdp3[b]);
		dp3[i] = add(dp3[i],-sumdp3[min(c+1,n+1)]);
		int somavoudp2 = add(dp2[i],-dp[i]);
		dp3[i] = add(dp3[i],mul(somavoudp2,2));
		dp3[i] = add(dp3[i],dp[i]);
		sumdp3[i] = add(dp3[i],sumdp3[i+1]);
	}
	cout << dp3[0] << '\n';
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	solve();
}