#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1000010;
const ll x[2] = {10007, 10000007}, p = 1e9+7;
const ll pp = 998244353;
char s[N], t[N]; 
ll hs[N][2], ht[N][2], pwr[N][2], r[N];
ll f[N][3], g[N];

int match(int x, int n, int y, int m){
    int l = 0, r = min(n-x+1, m-y+1);
    while(l < r){
        int mid = (l+r+1)/2;
        ll ths[2] = {(hs[x+mid-1][0] + p - hs[x-1][0] * pwr[mid][0] % p) % p,
                     (hs[x+mid-1][1] + p - hs[x-1][1] * pwr[mid][1] % p) % p};
        ll tht[2] = {(ht[y+mid-1][0] + p - ht[y-1][0] * pwr[mid][0] % p) % p,
                     (ht[y+mid-1][1] + p - ht[y-1][1] * pwr[mid][1] % p) % p};
        if(ths[0] == tht[0] && ths[1] == tht[1]) l = mid;
                                            else r = mid-1;
    }
    return l;
}

int main(){
    scanf("%s%s", s+1, t+1);
    int n = strlen(s+1), m = strlen(t+1);
    hs[0][0] = hs[0][1] = 0; ht[0][0] = ht[0][1] = 0; pwr[0][0] = pwr[0][1] = 1;
    for(int i = 1; i <= n; i++)
        hs[i][0] = (hs[i-1][0] * x[0] + s[i]) % p,
        hs[i][1] = (hs[i-1][1] * x[1] + s[i]) % p;
    for(int i = 1; i <= m; i++)
        ht[i][0] = (ht[i-1][0] * x[0] + t[i]) % p,
        ht[i][1] = (ht[i-1][1] * x[1] + t[i]) % p;
    for(int i = 1; i <= max(n, m); i++)
        pwr[i][0] = pwr[i-1][0] * x[0] % p,
        pwr[i][1] = pwr[i-1][1] * x[1] % p;
    // printf("%d\n", match(3, n, 1, m));
    for(int i = 1; i <= n; i++){
        int t = match(i, n, 1, m);
        if(i+t-1 < n && 1+t-1 < m) t++;
        if(i+t-1 < n && 1+t-1 < m)
            t += match(i+t, n, 1+t, m);
        r[i] = t;
    }
    // for(int i = 1; i <= n; i++) printf("%-3d", r[i]); printf("\n");
    f[0][0] = 1;
    for(int k = 0; k <= 2; k++){
        ll pre = 0;
        for(int i = 1; i <= n; i++) g[i] = 0;
        for(int i = 1; i <= n; i++){
            g[i] = (g[i]+f[i-1][k])%pp,   g[i+r[i]] = (g[i+r[i]]+pp-f[i-1][k])%pp;
            if(k>0) g[i] = (g[i]+f[i-1][k-1])%pp, g[i+r[i]] = (g[i+r[i]]+pp-f[i-1][k-1])%pp;
            pre = (pre + g[i]) % pp;
            f[i][k] = pre;
        }
    }
/*    for(int k = 0; k <= 2; k++){
        for(int i = 1; i <= n; i++)
            printf("%-3lld", f[i][k]);
        printf("\n");
    }*/
    printf("%lld\n", (f[n][2]*2 + f[n][1])%pp);
    return 0;
}