#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
template<typename T>inline void read(T &x){
    x=0;
    char ch=getchar();
    bool flag=0;
    while(ch>'9'||ch<'0') flag=flag||ch=='-',ch=getchar();
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
    x=flag?-x:x;
}
template<typename T,typename ...Args>inline void read(T &x,Args &...args){
    read(x),read(args...);
}
template<typename T>inline void prt(T x){
    if(x>9) prt(x/10);
    putchar(x%10+'0');
}
template<typename T>inline void put(T x){
    if(x<0) putchar('-'),x=-x;
    prt(x);
}
template<typename T>inline void put(char ch,T x){
    put(x),putchar(ch);
}
template<typename T,typename ...Args>inline void put(char ch,T x,Args ...args){
    put(ch,x),put(ch,args...);
}
#define N 2000005
#define ll long long
namespace SA{
	#define p1 1004535809
	#define p2 998244853
	#define base1 109
	#define base2 97
	char s[N];
	int n;
	ll pre1[N],bs1[N],pre2[N],bs2[N];
	inline void build(){
		for(int i=1;i<=n;i++) pre1[i]=(pre1[i-1]*base1+s[i])%p1;
		for(int i=1;i<=n;i++) pre2[i]=(pre2[i-1]*base2+s[i])%p2;
		bs1[0]=1;
		for(int i=1;i<=n;i++) bs1[i]=bs1[i-1]*base1%p1;
		bs2[0]=1;
		for(int i=1;i<=n;i++) bs2[i]=bs2[i-1]*base2%p2;
	} 
	inline ll calc1(int l,int r){
		return (pre1[r]-pre1[l-1]*bs1[r-l+1]%p1+p1)%p1;
	}
	inline ll calc2(int l,int r){
		return (pre2[r]-pre2[l-1]*bs2[r-l+1]%p2+p2)%p2;
	}
	inline int lcp(int x,int y){
		int l=1,r=min(n-x+1,n-y+1),res=0;
		while(l<=r){
			int mid=l+r>>1;
			if(calc1(x,x+mid-1)==calc1(y,y+mid-1)&&calc2(x,x+mid-1)==calc2(y,y+mid-1)) res=mid,l=mid+1;
			else r=mid-1;
		}
		return res;
	}
	#undef p1
	#undef p2
}
using SA::lcp;
char A[N],B[N];
int n,m,L[N],dis[N];
#define p 998244353
struct BIT{
	ll t0[N],t1[N],t2[N];
	BIT(){
		memset(t0,0,sizeof(t0));
		memset(t1,0,sizeof(t1));
		memset(t2,0,sizeof(t2));
	}
	#define lowbit(x) (x&-x)
	inline void update(int x,ll v0,ll v1,ll v2){
		x++;
		for(;x<=n+1;x+=lowbit(x)) 
			t0[x]=(t0[x]+v0)%p,t1[x]=(t1[x]+v1)%p,t2[x]=(t2[x]+v2)%p;
	}
	inline void update(int l,int r,ll v0,ll v1,ll v2){
		update(l,v0,v1,v2),update(r+1,p-v0,p-v1,p-v2);
	}
	inline pair<pair<ll,ll>,ll> query(int x){
		ll res0=0,res1=0,res2=0;
		x++;
		for(;x;x^=lowbit(x)) 
			res0=(res0+t0[x])%p,res1=(res1+t1[x])%p,res2=(res2+t2[x])%p;
		return make_pair(make_pair(res0,res1),res2);
	}
	#undef lowbit
}T;
int main(){
	scanf("%s%s",A,B);
	n=strlen(A),m=strlen(B);
	for(int i=1;i<=n;i++) SA::s[i]=A[i-1];
	SA::s[n+1]='#';
	for(int i=1;i<=m;i++) SA::s[i+n+1]=B[i-1];
	SA::n=n+m+1,SA::build();
	for(int i=1;i<=n;i++) L[i]=lcp(i,n+2);
	for(int i=1;i<=n;i++){
		if(L[i]>=m||i+L[i]>n){
			dis[i]=L[i];
			continue; 
		}
		dis[i]=L[i]+1+(L[i]+2<=m&&i+L[i]+1<=n?lcp(i+L[i]+1,n+3+L[i]):0);
	}
	T.update(0,0,1,0,0);
	for(int i=1;i<=n;i++){
		int l=i,r=i+dis[i]-1;
		if(l>r) continue;
		pair<pair<ll,ll>,ll> res=T.query(i-1);
		ll res0=res.first.first,res1=res.first.second,res2=res.second;
		T.update(l,r,res0%p,(res0+res1)%p,(res0+res1*2+res2)%p);
	}
	put('\n',T.query(n).second);
	return 0;
}