#include<bits/stdc++.h>
using std::cin;
using std::cout;
using ll = long long;
using u64 = unsigned long long;
std::string s, t;
const int N = 2000005;
const int mod = 998244353;
int n, m;
int lcp[N * 2];
struct pr {
	int c0, c1, c2;
};
pr operator + (pr x, pr y) {
	return {(x.c0 + y.c0) % mod, (x.c1 + y.c1) % mod, (x.c2 + y.c2) % mod};
}
pr operator - (pr x, pr y) {
	return {(x.c0 - y.c0) % mod, (x.c1 - y.c1) % mod, (x.c2 - y.c2) % mod};
}
pr operator * (pr x, pr y) {
	return {(ll) x.c0 * y.c0 % mod,
		((ll) x.c0 * y.c1 + (ll) x.c1 * y.c0) % mod,
		((ll) x.c0 * y.c2 + (ll) x.c2 * y.c0 + 2ll * x.c1 * y.c1) % mod,
	};
}

pr dp[N];
pr pre[N];

namespace hsh {
	int M;
	template <const int mod>
		struct OB {
			const int base = 124124;
			int hs[N], pw[N];
			void init(std::string s) {
				M = s.size();
				pw[0] = 1;
				for(int i = 1;i <= (int) s.size();++i) {
					hs[i] = ((u64) hs[i - 1] * base + s[i - 1] + 1) % mod;
					pw[i] = (u64) pw[i - 1] * base % mod;
				}
			}
			int sub(int l, int r) {
				return (hs[r] + hs[l] * u64(mod - pw[r - l])) % mod;
			}
		};
	OB<920028467> A;
	OB<998244353> B;
	int lcp(int a, int b) {
		int l = 0, r = std::min(M - a + 1, M - b + 1);
		for(;l + 1 < r;) {
			int mid = (l + r) >> 1;
			if(
					A.sub(a, a + mid) == A.sub(b, b + mid)
					&&
					B.sub(a, a + mid) == B.sub(b, b + mid)
					) {
				l = mid;
			} else {
				r = mid;
			}
		}
		return l;
	}
}
int main() {
#ifdef zqj
	freopen("1.in", "r", stdin);
#endif
	std::ios::sync_with_stdio(false), cin.tie(0);
	cin >> s >> t;
	n = s.size();
	m = t.size();
	auto v = t + s;
	lcp[0] = v.size();
	int l = 1, r = 1;
	for(int i = 1;i < (int) v.size();++i) {
		int & ans = lcp[i];
		if(i < r) ans = std::min(lcp[i - l], r - i);
		for(;i + ans < (int) v.size() && v[ans] == v[i + ans];) {
			++ ans;
		}
		if(ans > r) {
			l = i;
			r = i + ans;
		}
	}
	hsh::A.init(v);
	hsh::B.init(v);
	dp[0] = { 1, 0, 0 };
	pr x = { 1, 1, 0 };
	for(int i = 0;i < (int) s.size();++i) {
		int pos = i;
		pos += std::min(lcp[pos + t.size()], (int) t.size());
		pos += 1;
		if(pos < (int) s.size()) {
			pos += hsh::lcp(pos + t.size(), pos - i);
		}
		
		pos = std::min(pos, i + (int) t.size());

		dp[i] = dp[i] + pre[i];
		pre[i + 1] = pre[i + 1] + dp[i] * x + pre[i];
		pre[pos + 1] = pre[pos + 1] - dp[i] * x;
	}
	pr ans = pre[s.size()];
	ll out = (ans.c1 + ans.c2) % mod;
	out += mod;
	cout << out % mod << '\n';
}