#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define data dataa
#define pow pw
using LL=long long;
using ULL=unsigned long long;
using LD=long double;
#define gcd(x,y) __gcd(unsigned(x),unsigned(y))
const int P=31,D=1000173169;
const int MOD=998244353;
const int N=int(1e6)+10;
int pow[N<<1], f[N<<1],a[N<<1];
char s[N],t[N];
int n,m;
int hsh(int l, int r) { return (LL)(f[r]-(LL)f[l-1]*pow[r-l+1]%D+D)%D; }
int get(int x,int y)
{
    if(x>y)swap(x,y);
    int l=0,r=n+1+m-y+1+1;
    for(;l<r-1;)
    {
        int mid=(l+r)>>1;
        if(hsh(x,x+mid-1)==hsh(y,y+mid-1))l=mid;else r=mid;
    }
    return l;
}
int now[3],sum[N][3];
int main()
{
    scanf("%s%s",s+1,t+1);
    n=strlen(s+1);
    m=strlen(t+1);
    rep(i,n)a[i]=s[i]-'a'+1;
    a[n+1]=29;
    rep(i,m)a[n+1+i]=t[i]-'a'+1;
	pow[0] = 1;
	rep(i,n+1+m)pow[i] = (LL)pow[i-1]*P%D;
	rep(i,n+1+m)f[i] = (LL)((LL)f[i-1]*P+a[i])%D;
    sum[0][0]=1;sum[1][0]=MOD-1;
    for(int i=0;i<=n;i++)
    {
        for(int j=0;j<3;j++)now[j]=(now[j]+sum[i][j])%MOD;
        if(i==n)break;
        int len=0;
        if(s[i+1]==t[1])len=get(i+1,n+1+1);
        if(i+len+1<=n&&len<m)len++;
        if(i+len+1<=n&&len<m&&s[i+len+1]==t[len+1])len+=get(i+len+1,n+1+len+1);
        // printf("%d %d\n",i,len);
        // for(int j=0;j<3;j++)printf("%d ",now[j]);puts("");
        int l=i+1,r=i+len+1;
        sum[l][0]=(sum[l][0]+now[0])%MOD;
        sum[l][1]=(LL(sum[l][1])+now[0]+now[1])%MOD;
        sum[l][2]=(LL(sum[l][2])+now[0]+2*now[1]+now[2])%MOD;
        sum[r][0]=(sum[r][0]-now[0]+MOD)%MOD;
        sum[r][1]=(LL(sum[r][1])-now[0]-now[1]+2*MOD)%MOD;
        sum[r][2]=(LL(sum[r][2])-now[0]-2*now[1]-now[2]+4ll*MOD)%MOD;
    }
    printf("%d\n",now[2]);
    return 0;
}