#include <bits/stdc++.h>
#define debug cerr << "[" << __LINE__ << "] "
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> void chkmax(T& x, T y) { x = max(x, y); }
template <typename T> void chkmin(T& x, T y) { x = min(x, y); }
template <typename T> void read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
	x *= f;
}
const int N = 2e6 + 10, MOD = 998244353;
string s, t, st;
int n, m = 250, sa[N], rk[N], cnt[N], y[N], height[N], tt[25][N], lg[N];
inline void add(int &x, ll y) { x = (x + y) % MOD; }
void tsort() {
	F(i, 1, m) cnt[i] = 0;
	F(i, 1, n) cnt[rk[i]]++;
	F(i, 1, m) cnt[i] += cnt[i - 1];
	DF(i, n, 1) sa[cnt[rk[y[i]]]--] = y[i];
}
void SA() {
	n = st.size(); st = ' ' + st;
	F(i, 1, n) rk[i] = st[i], y[i] = i;
	tsort();
	for (int len = 1; ; len <<= 1) {
		int tot = 0;
		F(i, n - len + 1, n) y[++tot] = i;
		F(i, 1, n)
			if (sa[i] > len) y[++tot] = sa[i] - len;
		tsort();
		swap(rk, y);
		m = 0;
		F(i, 1, n) {
			if ((y[sa[i]] != y[sa[i - 1]]) || (y[min(n + 1, sa[i] + len)] != y[min(n + 1, sa[i - 1] + len)])) m++;
			rk[sa[i]] = m;
		}
		if (m == n) break;
	}
	int k = 0;
	F(i, 1, n) {
		if (rk[i] == 1) continue;
		if (k) k--;
		while (st[sa[rk[i] - 1] + k] == st[i + k]) k++;
		height[rk[i] - 1] = k;
	}
	// F(i, 1, n) cout << height[i] << " "; cout << endl;
}
int query(int l, int r) {
	l = rk[l], r = rk[r];
	if (l > r) swap(l, r);
	int k = lg[r - l];
	return min(tt[k][l], tt[k][r - (1 << k)]);
}
int f[N][3], lim[N], nn, ss[N][3];
signed main() {
	cin >> s >> t;
	int nn = s.size(), pos = s.size() + 2;
	st = s + "#" + t;
	SA();
	F(i, 2, n) lg[i] = lg[i >> 1] + 1;
	F(i, 0, lg[n])
		F(j, 1, n - (1 << i) + 1)
			if (i == 0) tt[i][j] = height[j];
			else tt[i][j] = min(tt[i - 1][j], tt[i - 1][j + (1 << (i - 1))]);
	f[0][0] = 1;
	F(i, 1, nn) {
		// if (st[i] == '#') break;
		lim[i] = query(i, pos);
		// debug << lim[i] << endl;
		if (lim[i] < nn - i + 1 && lim[i] < t.size()) {
			// cout << i + lim[i] << " " << pos + lim[i] << endl;
			lim[i] = lim[i] + 1 + query(i + lim[i] + 1, pos + lim[i] + 1);
		}
		// debug << i << " " << lim[i] << endl;
		F(j, 0, 2) if (f[i - 1][j]) {
			add(ss[i][j], f[i - 1][j]);
			add(ss[i + lim[i]][j], MOD - f[i - 1][j]);
			if (j != 2) {
				add(ss[i][j + 1], f[i - 1][j]);
				add(ss[i + lim[i]][j + 1], MOD - f[i - 1][j]);
			}
		}
		F(j, 0, 2) {
			add(ss[i][j], ss[i - 1][j]);
			add(f[i][j], ss[i][j]);
		}
		// F(j, 0, 2) cout << f[i][j] << " "; cout << endl;
	}
	cout << (f[nn][2] * 2ll + f[nn][1]) % MOD;
	return 0;
}