//
//   ____      _                           _          _    __     ____     ___    ____    _____ 
//  |  _ \    (_)   __ _   _ __     __ _  | |   ___  / |  / /_   |___ \   ( _ )  | ___|  |___  |
//  | | | |   | |  / _` | | '_ \   / _` | | |  / _ \ | | | '_ \    __) |  / _ \  |___ \     / / 
//  | |_| |   | | | (_| | | | | | | (_| | | | |  __/ | | | (_) |  / __/  | (_) |  ___) |   / /  
//  |____/   _/ |  \__,_| |_| |_|  \__, | |_|  \___| |_|  \___/  |_____|  \___/  |____/   /_/   
//          |__/                   |___/                                                        
//
//  [题目链接] ： 
//
//  [题目名称] ： 
//
//  [  做法  ] ： 
//
#include <bits/stdc++.h>
#define fir first
#define sec second
#define el '\n'
#define all(x) (x).begin(), (x).end()
#define FINISH cout << "FINISH" << endl;
#define debug(x) cout << #x << " :== " << x << endl;
#define debugv(x)\
    cout << #x << " :: ";\
    for (auto v : x) cout << v << " ";\
    cout << endl;

using namespace std;
typedef long long ll;
typedef pair<int, int> PII;

const int mod = 998244353;
const int inf32 = 0x3f3f3f3f;
const ll inf64 = 0x3f3f3f3f3f3f3f3f;
const int p1 = 998244353;
const int p2 = 1e9 + 9;

const int N = 1000000;
struct pii {
    ll x, y;
    bool operator == (const pii &b) {
        return x == b.x && y == b.y;
    }
    pii operator + (const pii &b) {
        return {(x + b.x) % p1, (y + b.y) % p2};
    }
    pii operator * (const pii &b) {
        return {x * b.x % p1, y * b.y % p2};
    }
    pii operator - (const pii &b) {
        return {(x - b.x + p1) % p1, (y - b.y + p2) % p2};
    }
    pii operator + (ll t) {
        return {(x + t) % p1, (y + t) % p2};
    }
}B = {233, 1331}, pw[N * 2 + 5], pa[N * 2 + 5];

pii getp (int l, int r, pii *h) {
    return h[r] - h[l - 1] * pw[r - l + 1];
}

void solve() 
{
    string s, t;
    cin >> t >> s;
    int lens = s.size();
    int lent = t.size();
    s = " " + s + "*" + t;
    int m = s.size() - 1;

    pw[0] = {1, 1};
    for (int i = 1; i <= m; i++) {
        pw[i] = pw[i - 1] * B;
        pa[i] = pa[i - 1] * B + s[i];
    }

    // debug(s);
    auto getlcp = [&] (int x1, int x2) -> int {
        int l = 0, r = m - x2 + 1;
        while (l < r) {
            int mid = (l + r + 1) >> 1;
            if (getp(x1, x1 + mid - 1, pa) == getp(x2, x2 + mid - 1, pa)) {
                l = mid;
            }
            else
                r = mid - 1;
        }
        // cout << x1 << " " << x2 << " " << l << endl;
        return l;
    };

    vector<int> lcp(lent + 1, 0);
    for (int i = lens + 2; i <= lens + lent + 1; i++) {
        int idx = i - lens - 1;
        lcp[idx] = getlcp(1, i);
        if (i + lcp[idx] <= m) {
            if (i + lcp[idx] + 1 <= m)
                lcp[idx] += getlcp(1 + lcp[idx] + 1, i + lcp[idx] + 1);
            lcp[idx]++;
        }
        lcp[idx] = min(lcp[idx], lens);
    }
    // debugv(lcp);

    int n = lent;
    vector<ll> now1(n + 3, 0), nown(n + 3, 0), nown2(n + 3, 0);
    vector<ll> sum1(n + 3, 0), sumn(n + 3, 0), sumn2(n + 3, 0);
    now1[n + 1] = sum1[n + 1] = 1;
    for (int i = n; i >= 1; i--) {
        int l = i, r = i + lcp[i];
        // cout << l + 1 << " " << r + 1 << endl;
        now1[i] = (sum1[l + 1] - sum1[r + 1]) % mod;
        nown[i] = (sumn[l + 1] - sumn[r + 1] + now1[i]) % mod;
        nown2[i] = (sumn2[l + 1] - sumn2[r + 1] + 2 * (sumn[l + 1] - sumn[r + 1]) + now1[i]) % mod;
        // cout << i << " " << now1[i] << " " << nown[i] << " " << nown2[i] << el;

        sum1[i] = (sum1[i + 1] + now1[i]) % mod;
        sumn[i] = (sumn[i + 1] + nown[i]) % mod;
        sumn2[i] = (sumn2[i + 1] + nown2[i]) % mod;
    }
    cout << (nown2[1] % mod + mod) % mod << el;
}

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