#include <bits/stdc++.h>

#define x first
#define y second
#define el '\n'
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 1e6 + 10, mod[2] = {998244353, (int)1e9 + 7}, base = 149;

void inc(ll &a, ll b, int o) {
    a += b;
    if (a >= mod[o]) a -= mod[o];
}

void dec(ll &a, ll b, int o) {
    a -= b;
    if (a < 0) a += mod[o];
}

ll add(ll a, ll b, int o) {
    a += b;
    return a < mod[o] ? a : a - mod[o];
}

ll del(ll a, ll b, int o) {
    a -= b;
    return a >= 0 ? a : a + mod[o];
}

ll cnt[N], sum[N];
ll dcnt[N], dsum[N];
char s[N], t[N];
ll hss[N][2], hst[N][2], p[N][2];
ll R[N], ways[N];

ll get(int l, int r, ll hs[][2], int o) {
    ll len = p[r - l + 1][o];
    return del(hs[r][o], hs[l - 1][o] * len % mod[o], o);
}

int main() {
    scanf("%s%s", s + 1, t + 1);
    cnt[1] = sum[1] = 1;
    int n = strlen(s + 1), m = strlen(t + 1);
    p[0][0] = p[0][1] = 1;
    for (int o = 0; o < 2; ++o) {
        for (int i = 1; i <= max(n, m); ++i) p[i][o] = p[i - 1][o] * base % mod[o];
        for (int i = 1; i <= n; ++i) hss[i][o] = add(hss[i - 1][o] * base % mod[o], s[i], o);
        for (int i = 1; i <= m; ++i) hst[i][o] = add(hst[i - 1][o] * base % mod[o], t[i], o);
    }
    ll ans = 0;
    for (int i = 1; i <= n; ++i) {
        inc(dcnt[i], dcnt[i - 1], 0), inc(dsum[i], dsum[i - 1], 0);
        inc(cnt[i], dcnt[i], 0), inc(sum[i], dsum[i], 0);
        int l = i - 1, r = min(n, i + m - 1), mid;
        while (l < r) {
            mid = l + r + 1 >> 1;
            if (get(i, mid, hss, 0) == get(1, mid - i + 1, hst, 0) 
                && get(i, mid, hss, 1) == get(1, mid - i + 1, hst, 1)) l = mid;
            else r = mid - 1;
        }
        l += 2;
        int ll = l - 1, rr = min(n, i + m - 1);
        while (ll < rr) {
            mid = ll + rr + 1 >> 1;
            if (get(l, mid, hss, 0) == get(l - i + 1, mid - i + 1, hst, 0)
                && get(l, mid, hss, 1) == get(l - i + 1, mid - i + 1, hst, 1)) ll = mid;
            else rr = mid - 1;
        }
        R[i] = rr + 1;
        inc(dcnt[i + 1], cnt[i], 0), inc(dsum[i + 1], add(sum[i] % mod[0], cnt[i] * 2 % mod[0], 0), 0);
        dec(dcnt[rr + 2], cnt[i], 0), dec(dsum[rr + 2], add(sum[i] % mod[0], cnt[i] * 2 % mod[0], 0), 0);
    }
    ways[n + 1] = 1;
    for (int i = n; i; --i) {
        ways[i] = del(ways[i + 1], ways[R[i] + 1], 0);
        inc(ans, ways[i] * sum[i] % mod[0], 0);
        inc(ways[i], ways[i + 1], 0);
    }
    printf("%lld\n", ans);
}