#include<bits/stdc++.h>
using namespace std;
const int maxn=1000005,base=1444441,MOD=998244353;
const long long mod=1000000000000000009;
int n,m;
int pos1[maxn],pos2[maxn],f[maxn][3],sum[maxn][3];
long long mul[maxn],hshs[maxn],hsht[maxn];
string s,t;
long long calcs(int l,int r){
	return (hshs[r]+(__int128)(mod-hshs[l-1])*mul[r-l+1])%mod;
}
long long calct(int l,int r){
	return (hsht[r]+(__int128)(mod-hsht[l-1])*mul[r-l+1])%mod;
}
inline void inc(int &x,int y){
	x+=y;
	if(x>=MOD)
		x-=MOD;
}
int main(){
	ios::sync_with_stdio(false);
	cin>>s>>t,n=s.size(),m=t.size();
	mul[0]=1;
	for(int i=1;i<=max(n,m);i++)
		mul[i]=(__int128)mul[i-1]*base%mod;
	for(int i=1;i<=n;i++)
		hshs[i]=((__int128)hshs[i-1]*base+s[i-1]-96)%mod;
	for(int i=1;i<=m;i++)
		hsht[i]=((__int128)hsht[i-1]*base+t[i-1]-96)%mod;
	for(int i=1;i<=n;i++){
		int L=i-1,R=min(i+m-1,n)+1;
		while(L+1<R){
			int mid=L+R>>1;
			if(calcs(i,mid)==calct(1,mid-i+1))
				L=mid;
			else R=mid;
		}
		pos1[i]=L;
		if(pos1[i]==min(i+m-1,n)){
			pos2[i]=min(i+m-1,n);
			continue;
		}
		L++,R=min(i+m-1,n)+1;
		while(L+1<R){
			int mid=L+R>>1;
			if(calcs(pos1[i]+2,mid)==calct(pos1[i]-i+3,mid-i+1))
				L=mid;
			else R=mid;
		}
		pos2[i]=L;
	}
	f[1][0]=1;
	/*for(int i=1;i<=n;i++)
		for(int j=i;j<=pos2[i];j++){
			inc(f[j+1][0],f[i][0]),inc(f[j+1][1],f[i][0]);
			inc(f[j+1][1],f[i][1]),inc(f[j+1][2],f[i][1]);
			inc(f[j+1][2],f[i][2]);
		}*/
	for(int i=1;i<=n+1;i++){
		if(i>1)
			for(int j=0;j<=2;j++)
				inc(sum[i][j],sum[i-1][j]),f[i][j]=sum[i][j];
		if(i<=n){
			int tmp=f[i][0];
			inc(sum[i+1][0],tmp),inc(sum[pos2[i]+2][0],MOD-tmp);
			inc(tmp,f[i][1]);
			inc(sum[i+1][1],tmp),inc(sum[pos2[i]+2][1],MOD-tmp);
			inc(tmp,MOD-f[i][0]),inc(tmp,f[i][2]);
			inc(sum[i+1][2],tmp),inc(sum[pos2[i]+2][2],MOD-tmp);
		}
	}
	int ans=(2ll*f[n+1][2]+f[n+1][1])%MOD;
	printf("%d\n",ans);
	return 0;
}