#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T read(){
    T x=0;char ch=getchar();bool fl=false;
    while(!isdigit(ch)){if(ch=='-')fl=true;ch=getchar();}
    while(isdigit(ch)){
        x=(x<<3)+(x<<1)+(ch^48);ch=getchar();
    }
    return fl?-x:x;
}
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define LL long long
#define read() read<int>()
const int maxn = 1e6 + 10;
const int P = 998244353;
inline void add(int &x,int y){
    x+=y;
    if(x>=P)x-=P;
}
struct Segment_Tree{
    struct tree{
        int l,r,val,tag;
    }t[maxn<<2];
    #define ls (p<<1)
    #define rs (p<<1|1)
    #define mid ((l+r)>>1)
    inline void pushup(int p){
        t[p].val=(t[ls].val+t[rs].val)%P;
    }
    inline void pushdown(int p){
        if(!t[p].tag)return ;
        int l=t[p].l,r=t[p].r;
        add(t[ls].tag,t[p].tag);add(t[rs].tag,t[p].tag);
        add(t[ls].val,1LL*(mid-l+1)*t[p].tag%P);
        add(t[rs].val,1LL*(r-mid)*t[p].tag%P);
        t[p].tag=0;
    }
    void build(int p,int l,int r){
        t[p].val=t[p].tag=0;
        t[p].l=l;t[p].r=r;
        if(l==r)return ;
        build(ls,l,mid);build(rs,mid+1,r);
    }
    void update(int p,int x,int y,int val){
        int l=t[p].l,r=t[p].r;
        if(x<=l && r<=y){
            add(t[p].tag,val);
            add(t[p].val,1LL*(r-l+1)*val%P);
            return ;
        }
        pushdown(p);
        if(x<=mid)update(ls,x,y,val);
        if(y>mid)update(rs,x,y,val);
        pushup(p);
    }
    int query(int p,int pos){
        int l=t[p].l,r=t[p].r;
        if(l==r)return t[p].val;
        pushdown(p);
        if(pos<=mid)return query(ls,pos);
        else return query(rs,pos);
    }
}T[3];
int n,m,r[maxn];
char s[maxn],t[maxn];
#define ull unsigned long long
#define Pair pair<ull,ull>
Pair h1[maxn],h2[maxn],power[maxn];
const ull Mod1 = 233;
const ull Mod2 = 998244353;
inline Pair has1(int l,int r){
    return make_pair(h1[r].first-h1[l-1].first*power[r-l+1].first,h1[r].second-h1[l-1].second*power[r-l+1].second);
}
inline Pair has2(int l,int r){
    return make_pair(h2[r].first-h2[l-1].first*power[r-l+1].first,h2[r].second-h2[l-1].second*power[r-l+1].second);
}
signed main(){
    FASTIO;
    cin>>s+1>>t+1;n=strlen(s+1);m=strlen(t+1);
    power[0].first=power[0].second=1;
    for(int i=1;i<=n;i++)power[i].first=power[i-1].first*Mod1,power[i].second=power[i-1].second*Mod2;
    for(int i=1;i<=n;i++)h1[i].first=h1[i-1].first*Mod1+(s[i]-'a'+1),h1[i].second=h1[i-1].second*Mod2+(s[i]-'a'+1);
    for(int i=1;i<=n;i++)h2[i].first=h2[i-1].first*Mod1+(t[i]-'a'+1),h2[i].second=h2[i-1].second*Mod2+(t[i]-'a'+1);
    for(int i=1;i<=n;i++){
        int L=i,R=min(n,i+m-1),res=i;
        while(L<=R){
            int Mid=(L+R)>>1;
            if(has1(i,Mid)==has2(1,Mid-i+1))res=Mid,L=Mid+1;
            else R=Mid-1;
        }
        if(s[res]==t[res-i+1] && res<n && res-i+1<m)res++;
        if(res==n || res-i+1==m)r[i]=res;
        else {
            r[i]=res;
            L=res+1,R=min(n,i+m-1);
            while(L<=R){
                int Mid=(L+R)>>1;
                if(has1(res+1,Mid)==has2(res-i+2,Mid-i+1))r[i]=Mid,L=Mid+1;
                else R=Mid-1;
            }
        }
        //cout<<i<<' '<<r[i]<<'\n';
    }
    for(int i=0;i<3;i++)T[i].build(1,0,n);
    T[0].update(1,0,0,1);
    for(int i=0;i<n;i++){
        int f0=T[0].query(1,i),f1=T[1].query(1,i),f2=T[2].query(1,i);
        T[0].update(1,i+1,r[i+1],f0%P);
        T[1].update(1,i+1,r[i+1],(f1+f0)%P);
        T[2].update(1,i+1,r[i+1],(1LL*f2+2LL*f1+1LL*f0)%P);
    }
    cout<<T[2].query(1,n)<<'\n';
    return 0;
}