#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

template <int P>
struct ModInt {
    int v;

    constexpr ModInt() : v(0) {}
    constexpr ModInt(i64 v_) : v(v_ % P) {
        if (v < 0) {
            v += P;
        }
    }
    constexpr explicit operator int() const { return v; }
    constexpr friend ostream& operator<<(ostream &out, ModInt n) {
        return out << int(n);
    }
    constexpr friend istream& operator>>(istream &in, ModInt &n) {
        i64 v;
        in >> v;
        n = ModInt(v);
        return in;
    }

    constexpr friend bool operator==(ModInt a, ModInt b) {
        return a.v == b.v;
    }
    constexpr friend bool operator!=(ModInt a, ModInt b) {
        return a.v != b.v;
    }

    constexpr ModInt operator-() {
        ModInt res;
        res.v = v ? P - v : 0;
        return res;
    }

    constexpr ModInt& operator++() {
        v++;
        if (v == P) v = 0;
        return *this;
    }
    constexpr ModInt& operator--() {
        if (v == 0) v = P;
        v--;
        return *this;
    }
    constexpr ModInt& operator+=(ModInt o) {
        v -= P - o.v;
        v = (v < 0) ? v + P : v;
        return *this;
    }
    constexpr ModInt& operator-=(ModInt o) {
        v -= o.v;
        v = (v < 0) ? v + P : v;
        return *this;
    }
    constexpr ModInt& operator*=(ModInt o) {
        v = 1LL * v * o.v % P;
        return *this;
    }
    constexpr ModInt& operator/=(ModInt o) { return *this *= o.inv(); }

    constexpr friend ModInt operator++(ModInt &a, int) {
        ModInt r = a;
        ++a;
        return r;
    }
    constexpr friend ModInt operator--(ModInt &a, int) {
        ModInt r = a;
        --a;
        return r;
    }

    constexpr friend ModInt operator+(ModInt a, ModInt b) {
        return ModInt(a) += b;
    }
    constexpr friend ModInt operator-(ModInt a, ModInt b) {
        return ModInt(a) -= b;
    }
    constexpr friend ModInt operator*(ModInt a, ModInt b) {
        return ModInt(a) *= b;
    }
    constexpr friend ModInt operator/(ModInt a, ModInt b) {
        return ModInt(a) /= b;
    }

    constexpr ModInt qpow(i64 p) {
        ModInt res = 1, x = v;
        while (p > 0) {
            if (p & 1) { res *= x; }
            x *= x;
            p >>= 1;
        }
        return res;
    }
    constexpr ModInt inv() {
        return qpow(P - 2);
    }
};

constexpr int P = 998244353;
using Mint = ModInt<P>;

// need to discretize
struct SuffixArray {
    int n;
    vector<int> sa, as, ha;
    vector<vector<int>> rmq;
template <typename T>
    vector<int> sais(const T &s) {
        int n = s.size(), m = *max_element(s.begin(), s.end()) + 1;
        vector<int> pos(m + 1), f(n);
        for (auto ch : s) { pos[ch + 1]++; }
        for (int i = 0; i < m; i++) { pos[i + 1] += pos[i]; }
        for (int i = n - 2; i >= 0; i--) { f[i] = s[i] != s[i + 1] ? s[i] < s[i + 1] : f[i + 1]; }
        vector<int> x(m), sa(n);
        auto induce = [&](const vector<int> &ls) {
            fill(sa.begin(), sa.end(), -1);
            auto L = [&](int i) { if (i >= 0 && !f[i]) { sa[x[s[i]]++] = i; }};
            auto S = [&](int i) { if (i >= 0 && f[i]) { sa[--x[s[i]]] = i; }};
            for (int i = 0; i < m; i++) { x[i] = pos[i + 1]; }
            for (int i = int(ls.size()) - 1; i >= 0; i--) { S(ls[i]); }
            for (int i = 0; i < m; i++) { x[i] = pos[i]; }
            L(n - 1);
            for (int i = 0; i < n; i++) { L(sa[i] - 1); }
            for (int i = 0; i < m; i++) { x[i] = pos[i + 1]; }
            for (int i = n - 1; i >= 0; i--) { S(sa[i] - 1); }
        };
        auto ok = [&](int i) { return i == n || !f[i - 1] && f[i]; };
        auto same = [&](int i, int j) {
            do { if (s[i++] != s[j++]) { return false; }} while (!ok(i) && !ok(j));
            return ok(i) && ok(j);
        };
        vector<int> val(n), lms;
        for (int i = 1; i < n; i++) { if (ok(i)) { lms.push_back(i); }}
        induce(lms);
        if (!lms.empty()) {
            int p = -1, w = 0;
            for (auto v : sa) {
                if (v != 0 && ok(v)) {
                    if (p != -1 && same(p, v)) { w--; }
                    val[p = v] = w++;
                }
            }
            auto b = lms;
            for (auto &v : b) { v = val[v]; }
            b = sais(b);
            for (auto &v : b) { v = lms[v]; }
            induce(b);
        }
        return sa;
    }
template <typename T>
    SuffixArray(const T &s) : n(s.size()), sa(sais(s)), as(n), ha(n - 1) {
        for (int i = 0; i < n; i++) { as[sa[i]] = i; }
        for (int i = 0, j = 0; i < n; ++i) {
            if (as[i] == 0) {
                j = 0;
            } else {
                for (j -= j > 0; i + j < n && sa[as[i] - 1] + j < n && s[i + j] == s[sa[as[i] - 1] + j]; ) { ++j; }
                ha[as[i] - 1] = j;
            }
        }
        if (n > 1) {
            int lg = __lg(n - 1);
            rmq.assign(lg + 1, vector<int>(n - 1));
            rmq[0] = ha;
            for (int i = 1; i <= lg; i++) {
                for (int j = 0; j + (1 << i) < n; j++) {
                    rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << i - 1)]);
                }
            }
        }
    }
    int lcp(int i, int j) {
        if (i == j) {
            return n - i;
        }
        i = as[i], j = as[j];
        if (i > j) {
            swap(i, j);
        }
        int k = __lg(j - i);
        return min(rmq[k][i], rmq[k][j - (1 << k)]);
    }
};

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    auto solve = [&]() {
        string s, t;
        cin >> s >> t;
        int n = s.size(), m = t.size();

        SuffixArray sa(s + '#' + t);
        auto lcp = [&](int i, int j) {
            // si, tj
            return sa.lcp(i, n + 1 + j);
        };

        vector dp(n + 1, vector<Mint>(3));
        dp[0][0] = 1;

        for (int i = 0; i < n; i++) {
            int j = i;
            j += lcp(j, 0);
            if (j < n && j - i < m) {
                j++;
                if (j < n && j - i < m) {
                    j += lcp(j, j - i);
                }
            }
            dp[i + 1][0] += dp[i][0];
            dp[i + 1][1] += dp[i][1] + dp[i][0];
            dp[i + 1][2] += dp[i][2] + 2 * dp[i][1] + dp[i][0];
            if (j + 1 <= n) {
                dp[j + 1][0] -= dp[i][0];
                dp[j + 1][1] -= dp[i][0] + dp[i][1];
                dp[j + 1][2] -= dp[i][2] + 2 * dp[i][1] + dp[i][0];
            }
            if (i > 0) {
                dp[i + 1][0] += dp[i][0];
                dp[i + 1][1] += dp[i][1];
                dp[i + 1][2] += dp[i][2];
            }
        }

        cout << dp[n][2] << '\n';
    };
    
    solve();
    
    return 0;
}