/*
Things to notice:
1. do not calculate useless values
2. do not use similar names
 
Things to check:
1. submit the correct file
2. time (it is log^2 or log)
3. memory
4. prove your naive thoughts 
5. long long
6. corner case like n=0,1,inf or n=m
7. check if there is a mistake in the ds or other tools you use
8. fileio in some oi-contest

9. module on time 
10. the number of a same divisor in a math problem
11. multi-information and queries for dp and ds problems
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pii pair<long long,long long>
#define mp make_pair
#define pb push_back
string s;
struct Hashing
{
	int mod,bse;
	int pw[2000005];
	int H1[2000005];
	void init(int M,int B)
	{
		int n=s.size();
		mod=M,bse=B;
		pw[0]=1;
		for(int i=1;i<=n;i++) pw[i]=1LL*pw[i-1]*bse%mod;
		for(int i=1;i<=n;i++) H1[i]=1LL*bse*H1[i-1]%mod+(s[i-1]-'a'),H1[i]%=mod;
	}
	int query1(int l,int r)
	{
		l++,r++;
		return (H1[r]-1LL*H1[l-1]*pw[r-l+1]%mod+mod)%mod;
	}
}h1,h2;
int lcp(int x,int y)
{
	int L=1,R=s.size()-max(x,y),res=0;
	while(L<=R)
	{
		int mid=(L+R)>>1;
		if(h1.query1(x,x+mid-1)!=h1.query1(y,y+mid-1)) R=mid-1;
		else if(h2.query1(x,x+mid-1)!=h2.query1(y,y+mid-1)) R=mid-1;
		else res=mid,L=mid+1;
	}
	return res;
}
const int mod=998244353;
const int inf=0x3f3f3f3f;
const int INF=1e18;
struct BIT
{
	int t[1000005];
	int lowbit(int x)
	{
		return x&(-x);	
	} 
	void update(int x,int d)
	{
		x++;
		for(int i=x;i<=1000001;i+=lowbit(i)) t[i]+=d,t[i]%=mod;
	}
	int query(int x)
	{
		int res=0;
		x++;
		for(int i=x;i>=1;i-=lowbit(i)) res+=t[i],res%=mod;
		return res;
	}
}dp[3]; 
string S,T;
int n,m;

void solve()
{
	cin>>S>>T;
	n=S.size(),m=T.size();
	s=T+S;
	h1.init(998244853,127),h2.init(1000000009,29);
	dp[0].update(0,1),dp[0].update(1,mod-1);
	for(int i=1;i<=n;i++)
	{
		int len=lcp(i-1+m,0);
		len++;
		len=min(len,min(m,n-i+1));
		len+=lcp(len,i-1+m+len);
		len=min(len,min(m,n-i+1));
		int R=i+len-1;
//		cout<<i<<" "<<R<<"\n";
		for(int j=0;j<3;j++)
		{
			int coef=dp[j].query(i-1);
//			cout<<i-1<<" "<<j<<" "<<coef<<"\n";
			for(int k=j;k<3;k++)
			{
				int coef2=coef;
				if(j==0&&k==1) coef2=2LL*coef%mod;
//				cout<<"-> "<<k<<" "<<i<<" "<<R<<" "<<coef<<"\n";
				dp[k].update(i,coef2),dp[k].update(R+1,(mod-coef2)%mod);
			}
		}
	}
	cout<<dp[2].query(n)<<"\n";
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int _=1;
//	cin>>_;
	while(_--) solve();
	return 0;
}