//#pragma GCC optimize("Ofast", "unroll-loops")
//#pragma GCC target("sse", "sse2", "sse3", "ssse3", "sse4")
#ifdef LOCAL
#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstdint>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <random>
#include <deque>
#include <functional>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <complex>
#include <numeric>
#include <cassert>
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <thread>
#else
#include <bits/stdc++.h>
#endif

#define all(a) a.begin(),a.end()
#define len(a) (int)(a.size())
#define mp make_pair
#define pb push_back
#define fir first
#define sec second
#define fi first
#define se second

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;

template<typename T>
inline bool umin(T &a, T b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<typename T>
inline bool umax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

#ifdef LOCAL
#define D for (bool _FLAG = true; _FLAG; _FLAG = false)
#define LOG(...) print(#__VA_ARGS__" ::", __VA_ARGS__) << endl
template <class ...Ts> auto &print(Ts ...ts) { return ((cerr << ts << " "), ...); }
#else
#define D while (false)
#define LOG(...)
#endif // LOCAL

const int max_n = -1, inf = 1000111222;

const int MOD = 998244353;
struct mint {
    int val;

    mint () : val(0) {}
    mint (int x) {
        if (-MOD <= x && x < MOD) {
            val = x;
        }
        else {
            val = x % MOD;
        }
        if (val < 0) val += MOD;
    }

    mint (ll x) {
        if (-MOD <= x && x < MOD) {
            val = x;
        }
        else {
            val = x % MOD;
        }
        if (val < 0) val += MOD;
    }

    mint (const mint& x) : val(x.val) {}

    constexpr mint& operator = (const mint& x) {
        val = x.val;
        return *this;
    }

    inline mint& operator += (const mint &x) {
        val += x.val;
        if (val >= MOD) {
            val -= MOD;
        }
        return *this;
    }

    inline mint& operator -= (const mint &x) {
        val -= x.val;
        if (val < 0) {
            val += MOD;
        }
        return *this;
    }

    inline mint operator - () const {
        mint tmp(*this);
        if (tmp.val) tmp.val = MOD - tmp.val;
        return tmp;
    }

    inline mint operator + (const mint &x) const {
        return mint(*this) += x;
    }

    inline mint operator - (const mint &x) const {
        return mint(*this) -= x;
    }

    inline mint& operator *= (const mint &x) {
        val = ((ll)val * x.val) % MOD;
        return *this;
    }

    inline mint operator * (const mint &x) const {
        return mint(*this) *= x;
    }

    inline mint binpow (int n) const {
        mint res = 1, tmp = *this;
        for (; n; n >>= 1) {
            if (n & 1) {
                res *= tmp;
            }
            tmp *= tmp;
        }
        return res;
    }

    inline mint inverse () const {
        return binpow(MOD - 2);
    }

    inline mint& operator /= (const mint &x) {
        return *this *= x.inverse();
    }

    inline mint operator / (const mint &x) {
        return mint(*this) *= x.inverse();
    }


    friend ostream& operator << (ostream &os, const mint &x) {
        os << x.val;
        return os;
    }

    friend istream& operator >> (istream &is, mint &x) {
        is >> x.val;
        return is;
    }

    inline bool operator == (const mint &x) const {
        return val == x.val;
    }

    inline bool operator != (const mint &x) const {
        return val != x.val;
    }

    inline bool operator < (const mint &x) const {
        return val < x.val;
    }

    inline bool operator > (const mint &x) const {
        return val > x.val;
    }

    friend string to_string (const mint &x) {
        return to_string(x.val);
    }

};

vector <mint> f = {1}, fi = {1};

inline mint fact (int n) {
    f.reserve(n + 1);
    while (len(f) <= n) {
        f.emplace_back(f.back() * len(f));
    }
    return f[n];
}

inline mint inv_fact (int n) { /// think
    if (len(fi) <= n) {
        fi.resize(n + 1, 0);
        mint val = mint(1) / fact(n);
        for (int i = n; fi[i] == 0; i--) {
            fi[i] = val;
            val *= i;
        }
    }
    return fi[n];
}

inline mint A (int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact(n) * inv_fact(n - k);
}

inline mint C (int n, int k) {
    if (k < 0 || k > n) return 0;
    return A(n, k) * inv_fact(k);
}



template <class T>
struct fenwick {
public:
    int n;
    vector <T> t; /// !!!


    fenwick (int n) : n(n) {
        t.assign(n, T(0));
    }

    inline void upd (int i, T x) {
        for (; i < n; i = i | (i + 1)) t[i] += x;
    }

    inline T sum (int r) {
        T ans = 0;
        for (; r >= 0; r = (r & (r + 1)) - 1) ans += t[r];
        return ans;
    }

    inline T sum (int l, int r) {
        if (l > r) return T(0); /// !!!
        return sum(r) - sum(l - 1);
    }
};

struct num {
    static const int MA = 1e9 + 7, MB = 1e9 + 9;

    int a, b;

    num() : a(0), b(0) { }
    num( int x ) : a(x), b(x) { }
    num( int a, int b ) : a(a), b(b) { }

    num operator + ( const num &x ) const { return num((a + x.a) % MA, (b + x.b) % MB); }
    num operator - ( const num &x ) const { return num((a + MA - x.a) % MA, (b + MB - x.b) % MB); }
    num operator * ( int x ) const { return num(((ll)a * x) % MA, ((ll)b * x) % MB); }
    num operator * ( const num &x ) const { return num(((ll)a * x.a) % MA, ((ll)b * x.b) % MB); }
    bool operator == ( const num &x ) const { return a == x.a && b == x.b; }
    bool operator != ( const num &x ) const { return !(a == x.a && b == x.b); }

};

template <class hash_t>
struct StrComparator {
    static const int P;
    static vector<hash_t> deg;

    int n;
    string s;
    hash_t *h;

    StrComparator( int n, string s ) : n(n), s(s) {
        h = new hash_t[n + 1];
        h[0] = 0;
        for (int i = 0; i < n; i++)
          h[i + 1] = h[i] * P + s[i];
        deg.reserve(n);
        while (deg.size() <= n)
          deg.push_back(*deg.rbegin() * P);
    }

    hash_t substr( int i, int len ) const { return h[i + len] - h[i] * deg[len]; }

    int lcp( int i, int j ) {
        int L = 0, R = n - max(i, j);
        while (L < R) {
          int M = (L + R + 1) / 2;
          if (substr(i, M) == substr(j, M))
            L = M;
          else
            R = M - 1;
        }
        return L;
    }

    int cmp( int a, int b ) {
        int LEN = n - max(a, b), L = lcp(a, b);
        return L < LEN ? (int)s[a + L] - s[b + L] : b - a;
    }

    bool operator() ( int i, int j ) { return cmp(i, j) < 0; }
};
template <class hash_t> vector <hash_t> StrComparator<hash_t>::deg(1, hash_t(1));
template <class hash_t> const int StrComparator<hash_t>::P = max(239, rand());



int main() {
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    string a, b;
    cin >> a >> b;
    int n = len(a), m = len(b);
    StrComparator <num> s(n, a);
    StrComparator <num> t(m, b);
    fenwick <mint> cnt(n + 2), dp(n + 2), add(n + 2);
    cnt.upd(0, 1);
    cnt.upd(1, -1);

    add.upd(0, 1);
    add.upd(1, -1);
    for (int i = 0; i < n; i++) {
        mint cur_cnt = cnt.sum(i);
        mint cur_add = add.sum(i);
        mint cur_dp = dp.sum(i);
        int l = 0, r = min(n - i, m);
        while (l < r) {
            int mid = (l + r + 1) >> 1;
            if (s.substr(i, mid) == t.substr(0, mid)) {
                l = mid;
            }
            else {
                r = mid - 1;
            }
        }
        int to = i + r + 1;
        int mx = min(m, r + 1);
//        mx = r + 1;
        if (to < n) {
            l = 0, r = min(m - mx, n - to);
            while (l < r) {
                int mid = (l + r + 1) >> 1;
                if (s.substr(to, mid) == t.substr(mx, mid)) {
                    l = mid;
                }
                else {
                    r = mid - 1;
                }
            }
            mx += r;
        }
        cnt.upd(i + 1, cur_cnt);
        cnt.upd(i + mx + 1, -cur_cnt);

        add.upd(i + 1, cur_cnt * 2);
        add.upd(i + mx + 1, -cur_cnt * 2);

        add.upd(i + 1, cur_add);
        add.upd(i + mx + 1, -cur_add);



        dp.upd(i + 1, cur_dp);
        dp.upd(i + mx + 1, -cur_dp);

        dp.upd(i + 1, cur_add);
        dp.upd(i + mx + 1, -cur_add);
    }
    mint ans = dp.sum(n);
    cout << ans << '\n';
}