#include<iostream>
#include<cstdio>
#define N 1000001
#define mod1 1000000007
#define mod2 1000000009
#define mod 998244353
#define Base1 131
#define Base2 171
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int MD1(int x)
{
	return x>=mod1?x-mod1:x;
}
int MD2(int x)
{
	return x>=mod2?x-mod2:x;
}
int MD3(int x)
{
	return x<0?x+mod1:x;
}
int MD4(int x)
{
	return x<0?x+mod2:x;
}
void Adder(int &x,int d)
{
	x+=d;
	if (x>=mod) x-=mod;
	return;
}
void Adder2(int &x,int d)
{
	x+=d;
	if (x<0) x+=mod;
	return;
}
struct reads
{
	int hsh1,hsh2;
	bool operator == (const reads &t)const
	{
		return hsh1==t.hsh1&&hsh2==t.hsh2;
	}
};
reads hsh[N+1],hsh2[N+1],pw[N+1];
int n,m,lg[N+1],C[3][3],r[N+1],dp[N+1][3],S[N+1][3];
string s,t;
reads operator + (reads a,reads b)
{
	return (reads){MD1(a.hsh1+b.hsh1),MD2(a.hsh2+b.hsh2)};
}
reads operator - (reads a,reads b)
{
	return (reads){MD3(a.hsh1-b.hsh1),MD4(a.hsh2-b.hsh2)};
}
reads operator * (reads a,reads b)
{
	return (reads){1ll*a.hsh1*b.hsh1%mod1,1ll*a.hsh2*b.hsh2%mod2};
}
reads calc(int l,int r)
{
	return hsh[r]-hsh[l-1]*pw[r-l+1];
}
reads calc2(int l,int r)
{
	return hsh2[r]-hsh2[l-1]*pw[r-l+1];
}
bool check(int l,int r,int x)
{
	return r-l+1<=m&&calc(x,r)==calc2(x-l+1,r-l+1);
}
int main()
{
	int d;
	for (int i=2;i<=N;++i) lg[i]=lg[i>>1]+1;
	for (int i=0;i<=2;++i) C[i][0]=1;
	for (int i=1;i<=2;++i)
		for (int j=1;j<=i;++j)
			C[i][j]=C[i-1][j-1]+C[i-1][j];
	pw[0]=(reads){1,1};
	for (int i=1;i<=N;++i) pw[i]=pw[i-1]*(reads){Base1,Base2};
	cin>>s>>t,n=s.length(),m=t.length();
	for (int i=1;i<=n;++i) hsh[i]=hsh[i-1]*(reads){Base1,Base2}+(reads){s[i-1],s[i-1]};
	for (int i=1;i<=m;++i) hsh2[i]=hsh2[i-1]*(reads){Base1,Base2}+(reads){t[i-1],t[i-1]};
	for (int i=1;i<=n;++i)
	{
		r[i]=i-1;
		for (int j=lg[n-i+1];j>=0;--j)
			if (r[i]+(1<<j)<=n&&check(i,r[i]+(1<<j),i))
				r[i]+=(1<<j);
		if (r[i]+1<=n&&r[i]-i+1<m)
		{
			r[i]++,d=r[i]+1;
			for (int j=lg[n-i+1];j>=0;--j)
				if (r[i]+(1<<j)<=n&&check(i,r[i]+(1<<j),d))
					r[i]+=(1<<j);
		}
	}
	dp[0][0]=1;
	for (int i=1;i<=n;++i)
	{
		for (int j=0;j<=2;++j) Adder(S[i][j],dp[i-1][j]),Adder2(S[r[i]+1][j],-dp[i-1][j]);
		for (int j=0;j<=2;++j) Adder(S[i][j],S[i-1][j]);
		for (int j=0;j<=2;++j)
			for (int k=0;k<=j;++k)
				Adder(dp[i][j],1ll*C[j][k]*S[i][k]%mod);
	}
	printf("%d\n",dp[n][2]);
	return 0;
}