#include "bits/stdc++.h"

using namespace std;
using lint = int64_t;

int minv(int a, int m) {
    a %= m; assert(a);
    return a == 1 ? 1 : int(m - int64_t(minv(m, a)) * m / a);
}

template<unsigned M_> struct modnum {
    static constexpr unsigned M = M_;
    using ll = int64_t; using ull = uint64_t; unsigned x;
    modnum& norm(unsigned a) { x = a < M ? a : a - M; return *this; }
    constexpr modnum(ll a = 0U) : x(unsigned((a %= ll(M)) < 0 ? a + ll(M) : a)) {}
    explicit operator int() const { return x; }
    modnum& operator+=(const modnum &a) {return norm(x + a.x); }
    modnum& operator-=(const modnum &a) {return norm(x - a.x + M); }
    modnum& operator*=(const modnum &a) { x = unsigned(ull(x)  * a.x % M); return *this; }
    modnum& operator/=(const modnum &a) { return (*this *= a.inv()); }
    modnum operator+ (const modnum &a) const { return (modnum(*this) += a); } 
    modnum operator- (const modnum &a) const { return (modnum(*this) -= a); } 
    modnum operator* (const modnum &a) const { return (modnum(*this) *= a); } 
    modnum operator/ (const modnum &a) const { return (modnum(*this) /= a); } 
    template<typename T> friend modnum operator+(T a, const modnum &b) { return (modnum(a) += b); }
    template<typename T> friend modnum operator-(T a, const modnum &b) { return (modnum(a) -= b); }
    template<typename T> friend modnum operator*(T a, const modnum &b) { return (modnum(a) *= b); }
    template<typename T> friend modnum operator/(T a, const modnum &b) { return (modnum(a) /= b); }
    modnum operator+() const {return *this; }
    modnum operator-() const {return modnum() - *this; }
    modnum pow(ll e) const {
        if(e < 0) return inv().pow(-e);
        modnum b = x, xe = 1U;
        for(; e; e >>= 1) { if(e & 1) xe *= b; b *= b; }
        return xe;
    }
    modnum inv() const {return minv(x, M); }
    friend modnum inv(const modnum &a) { return a.inv(); }
    explicit operator bool() const { return x; }
    friend bool operator==(const modnum &a, const modnum &b) {
        return a.x == b.x;
    }
    friend bool operator!=(const modnum &a, const modnum &b) {
        return a.x != b.x;
    }
    friend ostream &operator<<(ostream &os, const modnum &a) {
        return os << a.x;
    }
    friend istream &operator>>(istream &in, modnum &n) {
        ll v_;
        in >> v_;
        n = modnum(v_);
        return in;
    }
};

const int mod = 998244353;
using num = modnum<mod>;
const int b = 31;
using hnum = modnum<int(1e9) + 7>;


int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    string s, t;
    cin>>s>>t;
    int n = int(s.size()), m = int(t.size());
    vector<hnum>hs(n + 1), ht(m + 1), pot(m + 1); pot[0] = 1;
    for(int i=0;i<n;i++) hs[i+1] = hs[i] * b + (s[i] - 'a' + 1);
    for(int i=0;i<m;i++) ht[i+1] = ht[i] * b + (t[i] - 'a' + 1);
    for(int i=0;i<m;i++) pot[i+1] = pot[i] * b;
    vector<num>cnt(n + 1), sum(n + 1), ans(n + 1);
    vector<num>suf_cnt(n + 2), suf_sum(n + 2), suf_ans(n + 2);
    cnt[n] = suf_cnt[n] = 1;
    for(int i=n-1;i>=0;i--){
        int lo = 1, hi = min(n - i, m);
        while(lo <= hi){
            int mid = (lo + hi) >> 1;
            auto S = hs[i + mid] - hs[i] * pot[mid];
            auto T = ht[mid];
            if(S == T) lo = mid + 1;
            else hi = mid - 1;
        }
        int j = i + hi;
        if(j < n) j++;
        int x = j - i;
        if(j < n){
            lo = 1, hi = min(n - j, m);
            while(lo <= hi){
                int mid = (lo + hi) >> 1;
                auto S = hs[j + mid] - hs[j] * pot[mid];
                auto T = ht[x + mid] - ht[x] * pot[mid];
                if(S == T) lo = mid + 1;
                else hi = mid - 1;
            }
            j = j + hi;
        }
        j = min(j, i + m);
        cnt[i] = suf_cnt[i+1] - suf_cnt[j+1];
        sum[i] = suf_sum[i+1] - suf_sum[j+1] + cnt[i];
        ans[i] = suf_ans[i+1] - suf_ans[j+1] + 
                    2 * (suf_sum[i+1] - suf_sum[j+1]) + cnt[i];

        suf_cnt[i] = suf_cnt[i+1] + cnt[i];
        suf_sum[i] = suf_sum[i+1] + sum[i];
        suf_ans[i] = suf_ans[i+1] + ans[i];
    }
    cout<<ans[0]<<"\n";
    return 0;
}