#include <bits/stdc++.h>

using namespace std;
#define Fle freopen("in.in","r",stdin); freopen("out.out","w",stdout);
typedef long long LL;
LL p=131,mod[2]={1000000007,998244353};
LL ps=998244353;

int main()
{
	string s,t;
	cin>>s>>t;
	s=" "+s;
	t=" "+t;
	vector <vector <LL> > hashs(s.size()+10,vector <LL> (3,0)),hasht(t.size()+10,vector <LL> (3,0));
	for (int i=1;i<(int)s.size();i++){
		for (int j:{0,1}){
			hashs[i][j]=hashs[i-1][j]*p+s[i];
			hashs[i][j]%=mod[j];
		}
	}
	for (int i=1;i<(int)t.size();i++){
		for (int j:{0,1}){
			hasht[i][j]=hasht[i-1][j]*p+t[i];
			hasht[i][j]%=mod[j];
		}
	}
	vector <vector <LL> > prep(max(s.size(),t.size())+10,vector <LL> (3,1));
	for (int i=1;i<(int)prep.size();i++){
		for (int j:{0,1}){
			prep[i][j]=prep[i-1][j]*p%mod[j];
		}
	}
	
	vector <int> far(max(s.size(),t.size())+10,0);
	auto check=[&](int mid,int stas,int stat){
		int len=(mid-stas+1);
		bool ans=1;
		for (int i:{0,1}){
			if ((hashs[mid][i]-hashs[stas-1][i]*prep[len][i]%mod[i]+mod[i])%mod[i]
			!=(hasht[stat+len-1][i]-hasht[stat-1][i]*prep[len][i]%mod[i]+mod[i])%mod[i]) ans=false;
		}
		return ans;
	};
	
	for (int i=1;i<(int)s.size();i++){
		int L=i,R=min(L+t.size()-1,s.size()-1);
		while (L<R){
			int mid=(L+R+1)/2;
			if (check(mid,i,1)) L=mid;
			else R=mid-1;
		}
		if (L==i&&t[1]!=s[i]){
            L--;
            // cout<<i<<" "<<t[1]<<" "<<s[i]<<'\n';
        }
        // cout<<i<<" "<<L<<'\n';
		if (L-i+1>=t.size()-2||(L>=s.size()-2&&i>=L)){
			far[i]=min(i+t.size()-2,s.size()-1);
            // cout<<i<<" "<<L<<" "<<far[i]<<'\n';
			continue;
		}
		int newL=L+2;
        // cout<<i<<" "<<newL<<'\n';
		L=newL,R=min(newL+t.size()-1,s.size()-1);
		while (L<R){
			int mid=(L+R+1)/2;
			if (check(mid,newL,newL-i+1)) L=mid;
			else R=mid-1;
		}
		if (L==newL&&s[newL]!=t[newL-i+1]){
            L--;
            // cout<<i<<" "<<s[newL]<<" "<<t[newL-i+1]<<" "<<newL<<'\n';
        }
		far[i]=L;
	}
	// for (int i=1;i<(int)s.size();i++) cout<<far[i]<<" ";
	// cout<<'\n';
	vector <vector <LL> > dp(s.size()+10,vector <LL> (4,0));
	dp[(int)s.size()][1]=1;
	for (int i=s.size()-1;i>=1;i--){
		int r=i+1,l=far[i]+2;
		dp[i][1]=(dp[r][1]-dp[l][1]+ps)%ps;
		dp[i][3]=((dp[r][3]-dp[l][3]+ps)%ps+2*(dp[r][2]-dp[l][2]+ps)%ps+dp[i][1])%ps;
        dp[i][2]=(dp[r][2]-dp[l][2]+ps+dp[i][1])%ps;
		dp[i][1]=(dp[i][1]+dp[i+1][1])%ps;
		dp[i][2]=(dp[i][2]+dp[i+1][2])%ps;
		dp[i][3]=(dp[i][3]+dp[i+1][3])%ps;
        // cout<<dp[i][1]<<" "<<dp[i][2]<<" "<<dp[i][3]<<'\n';
	}
	cout<<(dp[1][3]-dp[2][3]+ps)%ps<<'\n';
}