#include <bits/stdc++.h>
#define int long long

using namespace std;

const int mod = 998244353;
const int P = 1331;

inline int read () {
    int w = 1, s = 0; char ch = getchar ();
    for (; ! isdigit (ch); ch = getchar ()) if (ch == '-') w = -1;
    for (; isdigit (ch); ch = getchar ()) s = (s << 1) + (s << 3) + (ch ^ 48);
    return s * w;
}

void solve () {
    string s, t;
    cin >> s >> t;

    const int n = s.size ();
    const int m = t.size ();

    s = " " + s;
    t = " " + t;

    const int N = max (n, m);

    vector <int> p (N + 1);
    p[0] = 1;
    for (int i = 1; i <= N; i ++) {
        p[i] = p[i - 1] * P % mod;
    }

    vector <int> Hash1 (n + 1), Hash2 (m + 1);
    for (int i = 1; i <= n; i ++) {
        Hash1[i] = (Hash1[i - 1] * P + s[i]) % mod;
    }
    for (int i = 1; i <= m; i ++) {
        Hash2[i] = (Hash2[i - 1] * P + t[i]) % mod;
    }

    vector <int> lcp (n + 1);
    for (int i = 1; i <= n; i ++) {
        auto check = [&] (int x) {
            int l1 = i, r1 = x;
            int l2 = 1, r2 = x - i + 1;
            // if (i == 3) {
            //     cerr << l1 << " " << r1 << " " << l2 << " " << r2 << '\n';
            // }
            int len = r1 - l1 + 1;
            int a = (Hash1[r1] - Hash1[l1 - 1] * p[len] % mod + mod) % mod;
            int b = (Hash2[r2] - Hash2[l2 - 1] * p[len] % mod + mod) % mod;
            return a == b;
        };
        auto check2 = [&] (int l1, int r1, int l2, int r2) {
            int len = r1 - l1 + 1;
            int a = (Hash1[r1] - Hash1[l1 - 1] * p[len] % mod + mod) % mod;
            int b = (Hash2[r2] - Hash2[l2 - 1] * p[len] % mod + mod) % mod;
            return a == b;
        };

        int l = i, r = min (n, i + m - 1);
        // if (i == 3) {
        //     cerr << l << " " << r << '\n';
        // }
        while (l < r) {
            int mid = (l + r + 1) / 2;
            if (check (mid)) {
                l = mid;
            } else {
                r = mid - 1;
            }
        }
        // if (i == 3) {
        //     cerr << l << '\n';
        // }
        if (l + 1 >= n) {
            lcp[i] = min (n, i + m - 1);
            continue;
        }
        if (l + 1 >= i + m - 1) {
            lcp[i] = i + m - 1;
            continue;
        }
        if (! check (l)) {
            l --;
        }
        
        // cerr << i << " " << l << '\n';
        int l1 = l + 2, l2 = l - i + 1;
        l = l + 2, r = min (n, i + m - 1);
        while (l < r) {
            int mid = (l + r + 1) / 2;
            if (check2 (l1, mid, l2, l2 + mid - l1)) {
                l = mid;
            } else {
                r = mid - 1;
            }
        }
        if (! check2 (l1, l1, l2, l2)) {
            l --;
        }
        lcp[i] = l;
    }

    // for (int i = 1; i <= n; i ++) {
    //     cerr << lcp[i] << " ";
    // }

    vector <int> suf1 (n + 3), suf2 (n + 3), suf3 (n + 3);
    suf1[n + 1] = 1;

    for (int i = n; i >= 1; i --) {
        int l = i + 1, r = lcp[i] + 1;
        suf1[i] = (suf1[l] - suf1[r + 1] + mod) % mod;
        suf2[i] = ((suf2[l] - suf2[r + 1] + mod) % mod + suf1[i]) % mod;
        suf3[i] = ((suf3[l] - suf3[r + 1] + mod) % mod + 2 * (suf2[l] - suf2[r + 1] + mod) % mod + suf1[i]) % mod;
        suf1[i] = (suf1[i] + suf1[i + 1]) % mod;
        suf2[i] = (suf2[i] + suf2[i + 1]) % mod;
        suf3[i] = (suf3[i] + suf3[i + 1]) % mod;
    }

    cout << (suf3[1] - suf3[2] + mod) % mod;
} 

signed main () {
	ios::sync_with_stdio (false);
    cin.tie (nullptr);
    
	int T = 1; 
	// cin >> T;
	// T = read ();

	while (T --) {
		solve ();
	}
	
	return 0;
}
/*
3 2 5 4 6 7 7
*/