#include<bits/stdc++.h>

using namespace std;

#define ff first
#define ss second
#define mp make_pair
#define pb push_back

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

const int N = (int) 105;
const int mod = (int) 998244353;

const int alpha = 400;
struct suffix_array {
	vector <int> sa, pos, lcp;
	suffix_array(string s) {
		s.push_back('$');
		int n = s.size(), mx = max(alpha, n) + 2;
		vector <int> a(n), a1(n), c(n + 1), c1(n + 1), head(mx), cnt(mx);
		pos = lcp = a;
		for (int i = 0; i < n; ++i) c[i] = s[i], a[i] = i, cnt[ c[i] ]++;
		for (int i = 0; i < mx - 1; ++i) head[i + 1] = head[i] + cnt[i];
		for (int k = 0; k < n; k = max(1, k << 1)) {
			for (int i = 0; i < n; ++i) { 
				int j = (a[i] - k + n) % n;
				a1[ head [ c[j] ]++ ] = j;
			}
			swap(a1, a);
			for (int i = 0, x = a[0], y, col = 0; i < n; ++i, x = a[i], y = a[i - 1]) { 
				c1[x] = (i && c[x] == c[y] && c[x + k] == c[y + k]) ? col : ++col;
				if (!i || c1[x] != c1[y]) head[col] = i;
			}
			swap(c1, c);
			if (c[a[n-1]] == n) break;
		}
		swap(sa, a);
		for (int i = 0; i < n; ++i) pos [ sa[i] ] = i;
		for (int i = 0, k = 0, j; i < n; lcp[ pos[i++] ] = k) {
			if (pos[i] == n - 1) continue;
			for (k = max(0, k-1), j = sa[pos[i] + 1]; s[i + k] == s[j + k]; k++);
		}
	}
	int &operator[] (int i) {return sa[i];}
};

struct rmq { 
	vector <vector<int>> table;
	rmq (vector<int> &v) : table (22, vector <int>(v.size())) { 
		int n = v.size();
		for (int i = 0; i < n; ++i) table[0][i] = v[i];
		for (int j = 1; (1<<j) <= n; ++j) {
			for (int i = 0; i + (1<<j - 1) < n; ++i) { 
				table[j][i] = min(table[j-1][i], table[j-1][i + (1<<j - 1)]);
			}
		}
	}
	int query (int a, int b) { 
		if (a > b) swap(a, b);
		b--;
		int j = 31 - __builtin_clz(b - a + 1);
		return min(table[j][a], table[j][b-(1<<j)+1]);
	}	
};

int main()
{
	cin.tie( NULL );
	ios_base::sync_with_stdio( 0 );

	#ifdef LOCAL
		freopen("input.txt", "r", stdin );
	#else
		#define endl '\n'
	#endif

	string s, t; cin >> s >> t;
	string nw = t + "0" + s;
	
	int n = s.size();
	int m = t.size();
	
	suffix_array sa(nw);
	rmq rm(sa.lcp);
	
	vector <int> nx(n);
	for (int i = 0; i < n; ++i) { 
		int fslcp = rm.query(sa.pos[m + 1 + i], sa.pos[0]);
		int ni = i + fslcp + 1;
		
		//cout << i << ' ' << ni << '\n';
		
		if (ni >= n) nx[i] = n;
		else {
			ni = ni + rm.query(sa.pos[m + 1 + ni], sa.pos[ni - i]);
			nx[i] = min(ni, n);
		}
		
		nx[i] = min(nx[i], i + m);
		
	//	cout << i << ' ' << nx[i] << '\n';
	}
	
	vector < pair<int, pii> > dp(n + 2);
	vector < pair<int, pii> > suf(n + 2);
	
	dp[n] = {0, {0, 1}};
	suf[n] = dp[n];
	suf[n + 1] = {0, {0,0}};
	
	for (int i = n - 1; i >= 0; --i) { 
		dp[i].ff = (1ll * ((1ll * mod + suf[i + 1].ff - suf[nx[i] + 1].ff) % mod) + (2ll * (1ll * mod + suf[i + 1].ss.ff - suf[nx[i] + 1].ss.ff) % mod) + ((1ll * mod + suf[i + 1].ss.ss - suf[nx[i] + 1].ss.ss) % mod)) % mod;
		dp[i].ss.ff = (1ll * ((1ll * mod + suf[i + 1].ss.ff - suf[nx[i] + 1].ss.ff) % mod) + ((1ll * mod + suf[i + 1].ss.ss - suf[nx[i] + 1].ss.ss) % mod)) % mod;
		dp[i].ss.ss = (1ll * mod + suf[i + 1].ss.ss - suf[nx[i] + 1].ss.ss) % mod;
		
	//	cout << ((1ll * mod + suf[i + 1].ff - suf[nx[i] + 1].ff) % mod)  << ' ' << (2ll * (1ll * mod + suf[i + 1].ss.ff - suf[nx[i] + 1].ss.ff) % mod) << ' ' << ((1ll * mod + suf[i + 1].ss.ss - suf[nx[i] + 1].ss.ss) % mod) << '\n';
		
		suf[i].ff = (1ll * suf[i + 1].ff + dp[i].ff) % mod;
		suf[i].ss.ff = (1ll * suf[i + 1].ss.ff + dp[i].ss.ff) % mod;
		suf[i].ss.ss = (1ll * suf[i + 1].ss.ss + dp[i].ss.ss) % mod;
		
	//	cout << i << ' ' << nx[i] << ' ' << dp[i].ff << ' ' << dp[i].ss.ff << ' ' << dp[i].ss.ss << '\n';
		
	}
	
	cout << dp[0].ff << '\n';
	
	
	return 0;
}