#include<bits/stdc++.h>
#define ull unsigned long long 
#define LL long long
#define ls (ro<<1)
#define rs ((ro<<1)|1)
#define Mid ((l+r)>>1)
using namespace std;
int const N=1e6+50,mo=998244353;
struct stu1{
	LL f,g,w; LL tf,tg,tw;
}t[N*4];
int nex[N],n,m;
char S[N],T[N];
ull P[3]={131,13331,114514},pw[3][N],haS[3][N],haT[3][N];
bool check(int l1,int r1,int l2,int r2){
	for(int k=0;k<3;k++){
		ull val1=haS[k][r1]-haS[k][l1-1]*pw[k][r1-l1+1];
		ull val2=haT[k][r2]-haT[k][l2-1]*pw[k][r1-l1+1];
		if(val1!=val2) return 0;
	}
   // cout<<l1<<' '<<r1<<' '<<l2<<' '<<r2<<' '<<r1-l1<<' '<<r2-l2<<' '<<val1<<' '<<val2<<endl;
	return 1;
}
void xg(int ro,int l,int r,int L,int R,stu1 val){
	if(L<=l&&r<=R){
		LL w1=val.f+val.g*2ll+val.w;
		LL w2=val.g+val.w;
		t[ro].tf+=w1; t[ro].tg+=w2; t[ro].tw+=val.w;
		t[ro].tf%=mo; t[ro].tg%=mo; t[ro].tw%=mo;
		return;
	}
	if(L<=Mid) xg(ls,l,Mid,L,R,val);
	if(R>Mid) xg(rs,Mid+1,r,L,R,val);
}
stu1 cx(int ro,int l,int r,int md){
	if(l==r){
		stu1 t1=t[ro];
		return (stu1){(t1.f+t1.tf)%mo,(t1.g+t1.tg)%mo,(t1.w+t1.tw)%mo};
	}
	stu1 t1,t2=t[ro]; 
	if(md<=Mid) t1=cx(ls,l,Mid,md);
	else t1=cx(rs,Mid+1,r,md);
	t1.f+=t2.tf; t1.g+=t2.tg; t1.w+=t2.tw;
	t1.f%=mo; t1.g%=mo; t1.w%=mo;
	return t1;
}
int main(){
	scanf("%s%s",S+1,T+1);
	n=strlen(S+1);
	m=strlen(T+1);
	for(int k=0;k<3;k++){
		pw[k][0]=1;
		for(int i=1;i<=max(n,m);i++) pw[k][i]=pw[k][i-1]*P[k];
		for(int i=1;i<=n;i++) haS[k][i]=haS[k][i-1]*P[k]+(S[i]-'a'+1);
		for(int i=1;i<=m;i++) haT[k][i]=haT[k][i-1]*P[k]+(T[i]-'a'+1);
	}
	
    
	for(int i=1;i<=n;i++){
		int l=i,r=min(n,i+m-1),mid,pos1,pos2;
		int n1=min(n,i+m-1);
		if(S[i]==T[1]){
			
			while(l+1<r){
				mid=(l+r>>1);  //1 1
				if(check(i,mid,1,mid-i+1)) l=mid;
				else r=mid-1;
			}
       	// cout<<l<<' '<<r<<' '<<r-i+1<<endl;
			if(check(i,r,1,r-i+1)) pos1=r;
			else pos1=l;
			pos1=min(pos1+1,min(n,i+m-1));
		}
        else pos1=i;
        
		
       // cout<<"qwq"<<pos1<<endl;
		int len=pos1-i+1;
		pos2=pos1;
    
		if(pos1!=min(n,i+m-1)){
			int l1=pos1+1,r1=min(n,i+m-1);  //不合法位置的后一个 
			while(l1+1<r1){
				mid=(l1+r1>>1); //len+1: 起点 
				if(check(pos1+1,mid,len+1,len+mid-(pos1+1)+1)) l1=mid;
				else r1=mid-1;
			}
			if(check(pos1+1,r1,len+1,len+r1-pos1)) pos2=r1;
			else if(check(pos1+1,l1,len+1,len+l1-pos1)) pos2=l1;
			else pos2=pos1;
		}
		nex[i]=pos2;
	//	cout<<nex[i]<<endl;
	}
	stu1 t1={0,0,1}; xg(1,1,n,1,nex[1],t1);
	for(int i=1;i<n;i++){
		t1=cx(1,1,n,i);
		xg(1,1,n,i+1,nex[i+1],t1);
       // cout<<t1.f<<' '<<t1.g<<' '<<t1.w<<endl;
	}
	t1=cx(1,1,n,n);
	printf("%lld",t1.f);
}