//#define dxx
#ifdef dxx
#define dbg(...) fprintf(stderr,__VA_ARGS__)
#define dex(a) dbg(#a"=%lld onL%d infun %s\n",a,__LINE__,__FUNCTION__)
#include<cstdlib>
#define pause sys##tem("pause")
#define _GLIBCXX_DEBUG
#endif

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<set>

using ll=long long;
using std::max;
using std::min;
using std::abs;
template<class T> void cmax(T&a,T b){a=max(a,b);}
template<class T> void cmin(T&a,T b){a=min(a,b);}
template<class T> T sqr(T a){return a*a;}

const ll ansmod=998244353;

int lb(int x){return x&-x;}
struct BIT{
	ll c[1000006],d[1000006];
	void _add(int i,ll x,int n){
		int j=i;
		for(--i;j<=n;j+=lb(j)){
			c[j]=(c[j]+x)%ansmod;
			d[j]=(d[j]+x*i%ansmod)%ansmod;
		}
	}ll _que(int i){
		ll ans=0;
		int j=i;
		for(;j;j-=lb(j))
			ans=(ans+i*c[j]%ansmod+ansmod-d[j])%ansmod;
		return ans;
	}void add(int l,int r,ll x,int n){
        _add(l,x,n);
        _add(r+1,ansmod-x,n);
    }ll que(int l,int r){
        return (_que(r)-_que(l-1)+ansmod)%ansmod;
    }
};

const ll Bas=127,Strmod=1e9+9;

namespace xm{
    BIT co,li,sq;
    int hsS[1000006],hsT[1000006],pbas[1000006];
    char szS[1000006],szT[1000006];
    ll rangehash(int*hsa,int l,int r){
        return ((ll)hsa[l-1]*pbas[r-l+1]-hsa[r]+Strmod)%Strmod;
    }void _(){
        int ls,lt;

        scanf("%s%s",szS+1,szT+1);
        ls=(int)strlen(szS+1);
        lt=(int)strlen(szT+1);

        pbas[0]=1;
        for(int i=1;i<=max(ls,lt);++i) pbas[i]=(ll)pbas[i-1]*Bas%Strmod;
        for(int i=1;i<=ls;++i) hsS[i]=((ll)hsS[i-1]*Bas+szS[i]-'a'+1)%Strmod;
        for(int i=1;i<=lt;++i) hsT[i]=((ll)hsT[i-1]*Bas+szT[i]-'a'+1)%Strmod;

        co.add(ls+1,ls+1,1,ls+1);
        li.add(ls+1,ls+1,0,ls+1);
        sq.add(ls+1,ls+1,0,ls+1);
        for(int i=ls;i;--i){
            ll thisco=0,thisli=0,thissq=0;
            int L,R,Mid,odif;

            L=i-1;
            R=min(i+lt,ls+1);
            while(L+1<R){
                Mid=L+R>>1;
                if(rangehash(hsS,i,Mid)==rangehash(hsT,1,Mid-i+1)) L=Mid;
                else R=Mid;
            }

            //printf("1(%d,%d)\n",L,R);
            if(L==i+lt-1||L==ls){
                thisco=co.que(i+1,L+1);
                co.add(i,i,thisco,ls+1);
                thisli=li.que(i+1,L+1);
                li.add(i,i,(thisli+2*thisco)%ansmod,ls+1);
                thissq=sq.que(i+1,L+1);
                sq.add(i,i,(thissq+thisli+thisco)%ansmod,ls+1);

                //printf("%lld %lld %lld %lld %lld %lld\n",thisco,thisli,thissq,thisco,(thisli+2*thisco)%ansmod,(thissq+thisli+thisco)%ansmod);
                continue;
            }

            odif=R;
            L=R;
            R=min(i+lt,ls+1);
            while(L+1<R){
                Mid=L+R>>1;
                //printf("chk [%d,%d] [%d,%d]",odif+1,Mid,odif-i+2,Mid-i+1);
                if(rangehash(hsS,odif+1,Mid)==rangehash(hsT,odif-i+2,Mid-i+1)) L=Mid;
                else R=Mid;
            }
            //printf("2(%d,%d)\n",L,R);
            thisco=co.que(i+1,L+1);
            co.add(i,i,thisco,ls+1);
            thisli=li.que(i+1,L+1);
            li.add(i,i,(thisli+2*thisco)%ansmod,ls+1);
            thissq=sq.que(i+1,L+1);
            sq.add(i,i,(thissq+thisli+thisco)%ansmod,ls+1);
                //printf("%lld %lld %lld %lld %lld %lld\n",thisco,thisli,thissq,thisco,(thisli+2*thisco)%ansmod,(thissq+thisli+thisco)%ansmod);
        }
        printf("%lld\n",sq.que(1,1));
    }
}

int main(){
    //freopen(".in","r",stdin);
    //freopen(".out","w",stdout);
    xm::_();
    return 0;
}