#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define op(x) ((x&1)?x+1:x-1)
#define odd(x) (x&1)
#define even(x) (!odd(x))
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define lowbit(x) (x&-x)
#define mp(x,y) make_pair(x,y)
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
using namespace std;
const ll MAXN = 2e6+10,mod = 998244353;
void add(ll& x,ll y){x = (x+y)%mod;}
void sub(ll& x,ll y){x = (x-y+mod)%mod;}

namespace SA{
	int sa[MAXN],rk[MAXN*2],oldrk[MAXN*2],cnt[MAXN];
	int p[MAXN],cur;

	int h[MAXN],st[21][MAXN];

	int lg(int l,int r){
		return 31 ^ __builtin_clz(r - l + 1);
	}

	void calc_sa(char* s,int n){
		if(n==1){ //corner case
			sa[1]=rk[1]=1;
			return;
		}
		int m=max(n,150);
		rep(i,1,n)rk[i]=s[i],cnt[rk[i]]++;
		rep(i,1,m)cnt[i] += cnt[i-1];
		per(i,n,1)sa[cnt[rk[i]]--]=i;

		for(int w=1;w<n;w<<=1){
			memset(cnt,0,sizeof cnt);cur=0;
			per(i,n,n-w+1)p[++cur]=i;
			rep(i,1,n)if(sa[i] > w)p[++cur]=sa[i]-w;

			rep(i,1,n)cnt[rk[i]]++;
			rep(i,1,m)cnt[i] += cnt[i-1];
			per(i,n,1)sa[cnt[rk[p[i]]]--]=p[i];

			rep(i,1,n)oldrk[i]=rk[i];

			rk[sa[1]]=1;
			rep(i,2,n){
				if(oldrk[sa[i-1]] == oldrk[sa[i]] && oldrk[sa[i-1]+w] == oldrk[sa[i]+w]){
					rk[sa[i]]=rk[sa[i-1]];
				}else{
					rk[sa[i]]=rk[sa[i-1]]+1;
				}
			}
		}
		int j=0;
		rep(i,1,n){
			if(j)j--;
			while(i+j <= n && sa[rk[i]-1]+j <= n && s[i+j]==s[sa[rk[i]-1]+j])j++;
			h[rk[i]]=j;
		}	
		//
		rep(i,1,n)st[0][i] = h[i];
		rep(k,1,20){
			rep(i,1,n-(1<<k)+1){
				st[k][i] = min(st[k-1][i],st[k-1][i+(1<<(k-1))]);
			}
		}
	}
	int qry(int l,int r){
		int len = lg(l,r);
		return min(st[len][l],st[len][r-(1<<len)+1]);
	}
	int lcp(int x,int y){
		x = rk[x],y = rk[y];
		if(x>y)swap(x,y);
		return qry(x+1,y);
	}
};

string s,t;
char tmp[MAXN];
int n,m;

int lcp(int x,int y){
	return SA::lcp(x,n+1+y);
}

int p[MAXN];
ll dp[MAXN][3],sum[MAXN][3],all[3];

void ext(int i){
	ll xx[3] = {};
	rep(a,0,2){
		ll v = dp[i][a];
		xx[a] += v;
		if(a^2)xx[a+1] += v;
	}
	rep(a,0,2){
		add(all[a],xx[a]);
		add(sum[p[i+1]][a],xx[a]);
	}
}

int main(){
	ios::sync_with_stdio(false);

	cin>>s>>t;n = s.length(),m = t.length();
	s=" "+s;
	t=" "+t;

	rep(i,1,n)tmp[i] = s[i];tmp[n+1]='#';rep(i,1,m)tmp[n+i+1] = t[i];
	SA::calc_sa(tmp,n+m+1);
	//
	rep(i,1,n){
		int len = lcp(i,1);
		if(i+len<=n && len+1<=m){
			len++;
			if(i+len<=n && len+1<=m){
				len += lcp(i+len,len+1);
			}
		}
		p[i] = i+len;

	}
	//
	
	dp[0][0] = 1;
	ext(0);

	rep(i,1,n){
		rep(j,0,2){
			sub(all[j],sum[i][j]);
			dp[i][j] = all[j];
		}

		if(i==n){
			cout<<(dp[n][2]*2ll + dp[n][1])%mod<<endl;
			exit(0);
		}else{
			ext(i);
		}
	}

    return 0;
}