#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
typedef long long LL;
const LL mod = 998244353;

int n, m;
LL base[2] = {29, 31};
LL hashmod[2] = {(LL)(1e9 + 9), (LL)(998244353)};
struct Shash
{
    int ls;
    LL hsh[2][N];
    LL pwMod[2][N];
    void init(string &S)
    {
        int n = S.size();
        S = ' ' + S;

        for (int i = 0; i < 2; ++i)
        {
            pwMod[i][0] = 1;
            for (int j = 1; j <= n; ++j)
            {
                pwMod[i][j] = pwMod[i][j - 1] * base[i] % hashmod[i];
                hsh[i][j] = (hsh[i][j - 1] * base[i] + S[j]) % hashmod[i];
            }
        }
    }
    pair<LL, LL> get(int l, int r)
    {
        pair<LL, LL> ans;
        ans.first = (hsh[0][r] - hsh[0][l - 1] * pwMod[0][r - l + 1]) % hashmod[0];
        ans.second = (hsh[1][r] - hsh[1][l - 1] * pwMod[1][r - l + 1]) % hashmod[1];
        ans.first = (ans.first + hashmod[0]) % hashmod[0];
        ans.second = (ans.second + hashmod[1]) % hashmod[1];
        return ans;
    }
};
Shash a, b;
void solve()
{
    string s, t;
    cin >> s >> t;
    int n = s.size(), m = t.size();
    a.init(s), b.init(t);
    vector<int> f(n + 1);
    for (int i = 1; i <= n; ++i)
    {

        int l = i - 1, r = min(n, i + m - 1);
        auto check = [&](int mid1, int st1, int st2) -> bool
        {
            int len = mid1 - st1 + 1;
            if (len == 0)
                return 1;
            return a.get(st1, mid1) == b.get(st2, st2 + len - 1);
        };

        while (l < r)
        {
            int mid = (l + r + 1) / 2;
            if (check(mid, i, 1))
                l = mid;
            else
                r = mid - 1;
        }

        int can = min(l + 1, min(n, i + m - 1)), len = can - i + 1;
        if (can <= n)
        {
            l = can, r = min(n, i + m - 1);
            while (l < r)
            {
                int mid = (l + r + 1) / 2;
                if (check(mid, can + 1, len + 1))
                    l = mid;
                else
                    r = mid - 1;
            }
            can = l;
        }
        f[i] = can;
    }

    // for (int i = 1; i <= n; ++i)
    //     cerr << "i = " << i << " f[i] = " << f[i] << endl;

    vector<LL> 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 = f[i] + 1;
        suf1[i] = (suf1[l] - suf1[r + 1]) % mod;
        suf2[i] = (suf2[l] - suf2[r + 1]) % mod + (suf1[i]) % mod;
        suf3[i] = (suf3[l] - suf3[r + 1]) % mod + 2 * (suf2[l] - suf2[r + 1]) % mod + (suf1[l] - suf1[r + 1]) % mod;
        // cerr << "i = " << i << " " << suf1[i] << " " << suf2[i] << " " << suf3[i] << endl;
        suf1[i] += suf1[i + 1];
        suf2[i] += suf2[i + 1];
        suf3[i] += suf3[i + 1];
        suf1[i] %= mod;
        suf2[i] %= mod;
        suf3[i] %= mod;
    }
    cout << ((suf3[1] - suf3[2]) % mod + mod) % mod << '\n';
}

int main()
{
    cin.tie(0)->sync_with_stdio(false);
    cout.tie(0);
    int T = 1;
    // cin >> T;
    while (T--)
    {
        solve();
    }
}