#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
const int N=1e6+5,P=998244353;
int n,m,dp[3][N],sum[3][N];char s[N],t[N];
ull base=131,hs[N],ht[N],p[N];
ull Hashs(int l,int r){return hs[r]-hs[l-1]*p[r-l+1];}
ull Hasht(int l,int r){return ht[r]-ht[l-1]*p[r-l+1];}
int Base=13331,Hs[N],Ht[N],pp[N];
int HashS(int l,int r){return (Hs[r]-1ll*Hs[l-1]*pp[r-l+1]%P+P)%P;}
int HashT(int l,int r){return (Ht[r]-1ll*Ht[l-1]*pp[r-l+1]%P+P)%P;}
bool check(int l,int r,int L,int R){
    return Hashs(l,r)==Hasht(L,R)&&
           HashS(l,r)==HashT(L,R);
}
int main(){
    scanf("%s",s+1);n=strlen(s+1);
    scanf("%s",t+1);m=strlen(t+1);
    p[0]=pp[0]=1;
    for(int i=1;i<=n;i++)
        p[i]=p[i-1]*base,pp[i]=1ll*pp[i-1]*Base%P,
        hs[i]=hs[i-1]*base+s[i],Hs[i]=(1ll*Hs[i-1]*Base+s[i])%P;
    for(int i=1;i<=m;i++)
        ht[i]=ht[i-1]*base+t[i],Ht[i]=(1ll*Ht[i-1]*Base+t[i])%P;
    dp[0][n+1]=sum[0][n+1]=1;
    for(int i=n;i>=1;i--){
        int L=i,R=n,pos1=i-1,pos2;
        while(L<=R){
            int mid=(L+R)>>1;
            if(check(i,mid,1,mid-i+1))
                pos1=mid,L=mid+1;
            else R=mid-1;
        }
        pos2=pos1+1;L=pos1+2;R=n;
        while(L<=R){
            int mid=(L+R)>>1;
            if(check(pos1+2,mid,pos1-i+3,mid-i+1))
                pos2=mid,L=mid+1;
            else R=mid-1;
        }
        pos2=min(pos2,n);pos2=min(pos2,i+m-1);
        //printf("%d ",pos2);
        dp[0][i]=(sum[0][i+1]-sum[0][pos2+2]+P)%P;
        dp[1][i]=(0ll+dp[0][i]+sum[1][i+1]-sum[1][pos2+2]+P)%P;
        dp[2][i]=(2ll*dp[1][i]-dp[0][i]+sum[2][i+1]-sum[2][pos2+2]+2*P)%P;
        sum[0][i]=(sum[0][i+1]+dp[0][i])%P;
        sum[1][i]=(sum[1][i+1]+dp[1][i])%P;
        sum[2][i]=(sum[2][i+1]+dp[2][i])%P;
    }
    printf("%d\n",dp[2][1]);
    return 0;
}