#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;

const int N=1e6+3,base=331,mod=998244353;
int n,m;
string a,b;

ull pw[N],ha[N],hb[N];
ull H(ull* h,int l,int r){
    return h[r]-h[l-1]*pw[r-l+1];
}

int pos[N];
ll f[N][3];
int main(){
    ios::sync_with_stdio(0);cin.tie(0);
    cin>>a>>b;
    n=a.length();
    m=b.length();
    a=" "+a,b=" "+b;

    pw[0]=1;
    for(int i=1;i<=max(n,m);++i)pw[i]=pw[i-1]*base;
    for(int i=1;i<=n;++i)ha[i]=ha[i-1]*base+a[i];
    for(int i=1;i<=m;++i)hb[i]=hb[i-1]*base+b[i];
    
    for(int i=1;i<=n;++i){
        int l=i,r=min(n,i+m-1),pos1=i-1;
        while(l<=r){
            int mid=(l+r)>>1;
            if(H(ha,i,mid)==H(hb,1,mid-i+1))pos1=mid,l=mid+1;
            else r=mid-1;
        }
        l=pos1+2,r=min(n,i+m-1);
        int pos2=pos1+1;
        while(l<=r){
            int mid=(l+r)>>1;
            if(H(ha,pos1+2,mid)==H(hb,pos1-i+3,mid-i+1))pos2=mid,l=mid+1;
            else r=mid-1;
        }
        pos[i]=min(min(n,i+m-1),pos2);
    }
    
    f[n+1][0]=1;
    for(int i=n;i>=1;--i){
        int j=pos[i]+1;
        ll dp[3]={
            f[i+1][0]-f[j+1][0],
            f[i+1][1]+f[i+1][0]-f[j+1][1]-f[j+1][0],
            f[i+1][2]+2*f[i+1][1]+f[i+1][0]-f[j+1][2]-2*f[j+1][1]-f[j+1][0]
        };
        f[i][0]=((f[i+1][0]+dp[0])%mod+mod)%mod;
        f[i][1]=((f[i+1][1]+dp[1])%mod+mod)%mod;
        f[i][2]=((f[i+1][2]+dp[2])%mod+mod)%mod;
    }
    cout<<(f[1][2]-f[2][2]+mod)%mod<<'\n';
}