#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 F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); 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;
ll norm(ll x) { return x >= mod ? x - mod : x; }
void add(ll& x,ll y){if((x+=y-mod)<0)x+=mod;}
void sub(ll& x,ll y){if((x-=y)<0)x+=mod;}

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

	int h[MAXN],stt[21][MAXN],y[MAXN*2];

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

	void tsort(int n) {
		F(i, 1, m) cnt[i] = 0;
		F(i, 1, n) cnt[rk[i]]++;
		F(i, 1, m) cnt[i] += cnt[i - 1];
		DF(i, n, 1) sa[cnt[rk[y[i]]]--] = y[i];
	}

	void calc_sa(string st,int n){

		if(n==1){ //corner case
			sa[1]=rk[1]=1;
			return;
		}
		F(i, 1, n) rk[i] = st[i], y[i] = i;
		tsort(n);
		for (int len = 1; ; len <<= 1) {
			int tot = 0;
			F(i, n - len + 1, n) y[++tot] = i;
			F(i, 1, n)
				if (sa[i] > len) y[++tot] = sa[i] - len;
			tsort(n);
			swap(rk, y);
			m = 0;
			F(i, 1, n) {
				if ((y[sa[i]] != y[sa[i - 1]]) || (y[min(n + 1, sa[i] + len)] != y[min(n + 1, sa[i - 1] + len)])) m++;
				rk[sa[i]] = m;
			}
			if (m == n) break;
		}

		int j=0;
		rep(i,1,n){
			if(j)j--;
			while(i+j <= n && sa[rk[i]-1]+j <= n && st[i+j]==st[sa[rk[i]-1]+j])j++;
			h[rk[i]]=j;
		}	
		//
		
		rep(i,1,n)stt[0][i] = h[i];
		rep(k,0,19){
			rep(i,2<<k,n){
				stt[k+1][i] = min(stt[k][i-(1<<k)],stt[k][i]);
			}
		}
		
	}
	int qry(int l,int r){
		int len = lg(l,r);
		return min(stt[len][r],stt[len][l+(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,tmp;
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] = {dp[i][0], norm(dp[i][0] + dp[i][1]), norm(dp[i][1] + dp[i][2])};
	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;

	tmp = s+"#"+t;
	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;
}