#include<iostream>
#include<cstring>
#include<vector>
using namespace std;
using LL = long long;
template<const int T>
struct ModInt {
    const static int mod = T;
    int x;
    ModInt(int x = 0) : x(x % mod) {}
    ModInt(long long x) : x(int(x % mod)) {} 
    int val() { return x; }
    ModInt operator + (const ModInt &a) const { int x0 = x + a.x; return ModInt(x0 < mod ? x0 : x0 - mod); }
    ModInt operator - (const ModInt &a) const { int x0 = x - a.x; return ModInt(x0 < 0 ? x0 + mod : x0); }
    ModInt operator * (const ModInt &a) const { return ModInt(1LL * x * a.x % mod); }
    ModInt operator / (const ModInt &a) const { return *this * a.inv(); }
    bool operator == (const ModInt &a) const { return x == a.x; };
    bool operator != (const ModInt &a) const { return x != a.x; };
    void operator += (const ModInt &a) { x += a.x; if (x >= mod) x -= mod; }
    void operator -= (const ModInt &a) { x -= a.x; if (x < 0) x += mod; }
    void operator *= (const ModInt &a) { x = 1LL * x * a.x % mod; }
    void operator /= (const ModInt &a) { *this = *this / a; }
    friend ModInt operator + (int y, const ModInt &a){ int x0 = y + a.x; return ModInt(x0 < mod ? x0 : x0 - mod); }
    friend ModInt operator - (int y, const ModInt &a){ int x0 = y - a.x; return ModInt(x0 < 0 ? x0 + mod : x0); }
    friend ModInt operator * (int y, const ModInt &a){ return ModInt(1LL * y * a.x % mod);}
    friend ModInt operator / (int y, const ModInt &a){ return ModInt(y) / a;}
    friend ostream &operator<<(ostream &os, const ModInt &a) { return os << a.x;}
    friend istream &operator>>(istream &is, ModInt &t){return is >> t.x;}

    ModInt pow(int64_t n) const {
        ModInt res(1), mul(x);
        while(n){
            if (n & 1) res *= mul;
            mul *= mul;
            n >>= 1;
        }
        return res;
    }
    
    ModInt inv() const {
        int a = x, b = mod, u = 1, v = 0;
        while (b) {
            int t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        if (u < 0) u += mod;
        return u;
    }
    
};
using mint = ModInt<998244353>;

const int maxn = 4e6 + 5;
string s, t;
int sa[maxn], height[maxn], rk[maxn], x[maxn], y[maxn], c[maxn];
int n, m;

// 不要使用全局变量使用指针,后缀数组常数很大,效率差很多
void get_sa(int *x, int *y, int *c, int *sa){
    for(int i = 1; i <= m; i++) c[i] = 0;
    for(int i = 1; i <= n; i++) c[x[i] = s[i]]++;
    for(int i = 2; i <= m; i++) c[i] += c[i - 1];
    for(int i = n; i; i--) sa[c[x[i]]--] = i;
    for(int k = 1; k <= n; k <<= 1){
        int num = 0;
        for(int i = n - k + 1; i <= n; i++) y[++num] = i;
        for(int i = 1; i <= n; i++)
            if (sa[i] > k)
                y[++num] = sa[i] - k;
        for(int i = 1; i <= m; i++) c[i] = 0;
        for(int i = 1; i <= n; i++) c[x[i]]++;
        for(int i = 2; i <= m; i++) c[i] += c[i - 1];
        for(int i = n; i; i--) sa[c[x[y[i]]]--] = y[i], y[i] = 0;
        swap(x, y);
        x[sa[1]] = 1, num = 1;
        for(int i = 2; i <= n; i++)
            x[sa[i]] = (y[sa[i]] == y[sa[i - 1]] && y[sa[i] + k] == y[sa[i - 1] + k]) ? num : ++num; 
        if (num == n) break;
        m = num;
    }
}

void get_height(int *height, int *sa, int *rk){
    for(int i = 1; i <= n; i++) rk[sa[i]] = i;
    for(int i = 1, k = 0; i <= n; i++){
        if (rk[i] == 1) continue;
        if (k) k--;
        int j = sa[rk[i] - 1];
        while(i + k <= n && j + k <= n && s[i + k] == s[j + k]) k++;
        height[rk[i]] = k;
    }
}

const int M = 20;
int f[M + 1][maxn];
void init(){
    for(int i = 1; i <= n; i++) f[0][i] = height[i];
    for(int j = 1; j <= M; j++)
        for(int i = 1; i + (1 << j) - 1 <= n; i++)
            f[j][i] = min(f[j - 1][i], f[j - 1][i + (1 << j - 1)]);
}
    
int query(int l, int r){
    int k = __lg(r - l + 1);
    return min(f[k][l], f[k][r - (1 << k) + 1]);
}
    
int lcp(int l, int r){
    if (l == r) return n - r + 1;
    l = rk[l], r = rk[r];
    if (l > r) swap(l, r);
    l++;
    return query(l, r);
}

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    cin >> t >> s;
    const int len1 = s.size(), len2 = t.size();
    s = " " + s + "?" + t;

    n = len1 + len2 + 1, m = 122;
    get_sa(x, y, c, sa);
    get_height(height, sa, rk);
    init();

    vector<mint> dp0(len2 + 1), dp1(len2 + 1), dp2(len2 + 1);
    dp0[0] = 1;
    for(int i = 1; i <= len2; i++){
        int pos = len2 - i + 1;
        int mx = min(i, len1);
        int len = lcp(1, len1 + 1 + pos);
        if (len != mx) len++;
        if (len != mx){
            len += lcp(len + 1, len1 + 1 + pos + len);
        }
        mint s2 = dp2[i - 1] - (i == len ? 0 : dp2[i - len - 1]);
        mint s1 = dp1[i - 1] - (i == len ? 0 : dp1[i - len - 1]);
        mint s0 = dp0[i - 1] - (i == len ? 0 : dp0[i - len - 1]);
        dp2[i] = s2 + 2 * s1 + s0;
        dp1[i] = s1 + s0;
        dp0[i] = s0;
        dp2[i] += dp2[i - 1];
        dp1[i] += dp1[i - 1];
        dp0[i] += dp0[i - 1];
    }
    cout << dp2[len2] - dp2[len2 - 1] << '\n';

}