// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
#define ull unsigned long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define mod 998244353
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 2000005
#define inf 0x3f3f3f3f

struct SA{
	int n,m,sa[maxn],x[maxn],y[maxn],c[maxn],h[maxn];
	int st[maxn][21],lg[maxn];
	char s[maxn];
	void getsa()
	{
		m=127;
		For(i,2,n)lg[i]=lg[i>>1]+1;
		For(i,1,n)c[x[i]=s[i]]++;
		For(i,2,m)c[i]+=c[i-1];
		Rep(i,n,1)sa[c[x[i]]--]=i;
		for(int k=1;k<=n;k<<=1)
		{
			int num=0;
			For(i,n-k+1,n)y[++num]=i;
			For(i,1,n)if(sa[i]>k)y[++num]=sa[i]-k;
			For(i,1,m)c[i]=0;
			For(i,1,n)c[x[i]]++;
			For(i,2,m)c[i]+=c[i-1];
			Rep(i,n,1)sa[c[x[y[i]]]--]=y[i],y[i]=0;
			swap(x,y);
			x[sa[1]]=num=1;
			For(i,2,n)
				x[sa[i]]=(y[sa[i]]==y[sa[i-1]] && y[sa[i]+k]==y[sa[i-1]+k])?num:++num;
			if(num==n)break;
			m=num;
		}
	}
	inline void geth(){
		int k=0;
		For(i,1,n)x[sa[i]]=i;
		For(i,1,n)
		{
			if(k)k--;
			int j=sa[x[i]-1];
			while(j+k<=n&&i+k<=n&&s[j+k]==s[i+k])k++;
			h[x[i]]=k; 
		}
	}
	void build(){
		getsa(),geth();
		For(i,1,n)st[i][0]=h[i];
		For(w,1,20)
			For(i,1,n+1-(1<<w))
				st[i][w]=min(st[i][w-1],st[i+(1<<(w-1))][w-1]);
	}
	inline int lcp(int a,int b){
		if(a==b)return n-a+1;
		int l=x[a],r=x[b];
		if(l>r)swap(l,r);
		l++;int k=lg[r-l+1];
		return min(st[l][k],st[r-(1<<k)+1][k]);
	}
}sa;

char s[maxn],t[maxn];
int n,m;
modint f[maxn][2][2],res;
modint sf[maxn][2][2];

int Q(int i,int j){
	if(i>n||j>m)return 0;
	int res=sa.lcp(i,j+n);
	res=min(res,min(n-i+1,m-j+1));
	return res;
}
int go[maxn];

signed main()
{
	scanf("%s%s",s+1,t+1);
	n=strlen(s+1),m=strlen(t+1);
	For(i,1,n)sa.s[++sa.n]=s[i];
	For(i,1,m)sa.s[++sa.n]=t[i];
	sa.build();
	For(i,1,n){
		go[i]=0;
		go[i]=Q(i,1);
	//	cout<<"Go "<<go[i]<<"\n";
		if(go[i]!=n-i+1 && go[i]!=m){
			++go[i];
			if(go[i]!=n-i+1){
				go[i]+=Q(i+go[i],1+go[i]);
			}
		}
		go[i]=min(go[i],m);
	//	cout<<"i,go "<<i<<" "<<go[i]<<"\n";
	}
	f[0][0][0]=1;
	For(i,0,n){
		if(i){
			For(x,0,1)For(y,0,1)sf[i][x][y]+=sf[i-1][x][y];
			For(x,0,1)For(y,0,1)f[i][x][y]+=sf[i][x][y];
		}
		if(i){
			For(j,0,1)f[i][j][1]+=f[i][j][0];
			For(j,0,1)f[i][1][j]+=f[i][0][j];
		}
		int l=i+1,r=i+go[i+1];
		if(l<=r){
			For(x,0,1)For(y,0,1)
				sf[l][x][y]+=f[i][x][y],sf[r+1][x][y]-=f[i][x][y];
		}
//		For(j,i+1,i+go[i+1]){
//			For(x,0,1)For(y,0,1)f[j][x][y]+=f[i][x][y];
//		}
	}
	modint res=0;
	res=f[n][1][1];
	cout<<res.x<<"\n";
	return 0;
}
/*

*/