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

const int N = 1e6 + 10;

using ull = unsigned long long ;

const ull P1 = 131;
const ull P2 = 13331;

int n, m;
ull base1[N], base2[N], tb[N][2], H[N][2], f[N], g[N], h[N];

void add(ull &a, ull b) { a += b; if (a >= mod) a -= mod; }	

bool judge(int l, int r, int last) {
	int len = r - l + 1;
	
	ull v1 = H[r][0] - H[l - 1][0] * base1[len];
	ull v2 = H[r][1] - H[l - 1][1] * base2[len];
	
	ull v3 = tb[last + len][0] - tb[last][0] * base1[len];
	ull v4 = tb[last + len][1] - tb[last][1] * base2[len];
	
	return v1 == v3 && v2 == v4;
}

int get(int pos) {
	int ub = min(pos + m - 1, n);
		
	int l = pos, r = ub, res = l - 1;
	while (l <= r) {
		int mid = (l + r) >> 1;
		if (judge(l, mid, l - pos)) l = (res = mid) + 1;
		else r = mid - 1;
	}
	
	if (res == ub) return res;
	
	l = res + 2, r = ub, res = l - 1;
	while (l <= r) {
		int mid = (l + r) >> 1;
		if (judge(l, mid, l - pos)) l = (res = mid) + 1;
		else r = mid - 1;
	}
	
	return res;
}

void solve() {
	base1[0] = base2[0] = 1;
	for (int i = 1; i < N; i++) {
		base1[i] = base1[i - 1] * P1;
		base2[i] = base2[i - 1] * P2;
	}
	
	string s, t;
	cin >> s >> t;
	
	n = s.size();
	m = t.size();
	
	for (int i = 1; i <= m; i++) {
		tb[i][0] = tb[i - 1][0] * P1 + t[i - 1];
		tb[i][1] = tb[i - 1][1] * P2 + t[i - 1];
	}
	
	for (int i = 1; i <= n; i++) {
		H[i][0] = H[i - 1][0] * P1 + s[i - 1];
		H[i][1] = H[i - 1][1] * P2 + s[i - 1];
	}
	
	h[0] = 1;
	for (int i = 1; i <= n; i++) {
		
		if (i > 1) {
			add(f[i], f[i - 1]);
			add(g[i], g[i - 1]);
			add(h[i], h[i - 1]);
		}
		
		int pos = get(i);
		
		add(f[i], (f[i - 1] + g[i - 1] * 2 + h[i - 1]) % mod);
		add(f[pos + 1], (mod - (f[i - 1] + g[i - 1] * 2 + h[i - 1]) % mod) % mod);
		
		add(g[i], (g[i - 1] + h[i - 1]) % mod);
		add(g[pos + 1], (mod - (g[i - 1] + h[i - 1]) % mod) % mod);
		
		add(h[i], h[i - 1]);
		add(h[pos + 1], (mod - h[i - 1]) % mod);
	}
	
	cout << f[n];
}

signed main() {
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	solve();
	return 0;
}