#include<bits/stdc++.h>
using namespace std;
using ll = long long;
template <ll P>
class mod_int {
	using Z = mod_int;

private:
	static int mo(ll x) { return x < 0 ? x + P : x; }

public:
	ll x;
	ll val() const { return x; }
	mod_int() : x(0) {}
	template <class T>
	mod_int(const T &x_) : x(x_ >= 0 && x_ < P ? static_cast<ll>(x_) : mo(static_cast<ll>(x_ % P))) {}
	bool operator==(const Z &rhs) const { return x == rhs.x; }
	bool operator!=(const Z &rhs) const { return x != rhs.x; }
	Z operator-() const { return Z(x ? P - x : 0); }
	Z pow(long long k) const {
		Z res = 1, t = *this;
		while (k) {
			if (k & 1) res *= t;
			if (k >>= 1) t *= t;
		}
		return res;
	}
	Z &operator++() {
		x < P - 1 ? ++x : x = 0;
		return *this;
	}
	Z &operator--() {
		x ? --x : x = P - 1;
		return *this;
	}
	Z operator++(int) {
		Z ret = x;
		x < P - 1 ? ++x : x = 0;
		return ret;
	}
	Z operator--(int) {
		Z ret = x;
		x ? --x : x = P - 1;
		return ret;
	}
	Z inv() const { return pow(P - 2); }
	Z &operator+=(const Z &rhs) {
		(x += rhs.x) >= P && (x -= P);
		return *this;
	}
	Z &operator-=(const Z &rhs) {
		(x -= rhs.x) < 0 && (x += P);
		return *this;
	}
	Z &operator*=(const Z &rhs) {
		x = (__int128)1 * x * rhs.x % P;
		return *this;
	}
	Z &operator/=(const Z &rhs) { return *this *= rhs.inv(); }
#define setO(T, o)                                 \
	friend T operator o(const Z &lhs, const Z &rhs) {\
		Z res = lhs;                                   \
		return res o## = rhs;                          \
	}
	setO(Z, +) setO(Z, -) setO(Z, *) setO(Z, /)
#undef setO
};
const ll P = 1000000001011451423;
using Z = mod_int<P>;
#define ull Z
#define ll long long
ull bs=19260817;
const ll N=1e6+37,mod=998244353;
char s[N],t[N];
int n,m,nxt[N];ll ans[N];
ll dp[N],dp2[N],tg[N],tg2[N];
ll cdp[N],cdp2[N],cans[N];
ull hs[N],pw[N],ht[N];
ull gt(int x,int y){
	return hs[y]-hs[x-1]*pw[y-x+1];
}ull gt2(int x,int y){
	return ht[y]-ht[x-1]*pw[y-x+1];
}signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);cin>>(s+1)>>(t+1);
	n=strlen(s+1),m=strlen(t+1);
	pw[0]=1;
	for(int i=1;i<N;i++)
		pw[i]=pw[i-1]*bs;
	for(int i=1;i<=n;i++)
		hs[i]=bs*hs[i-1]+(ull)(s[i]-'a'+1);
	for(int i=1;i<=m;i++)
		ht[i]=bs*ht[i-1]+(ull)(t[i]-'a'+1);
	for(int i=1;i<=n;i++){
		int l=i,r=min(n,i+m-1),as=i-1;
		while(l<=r){
			int mid=(l+r)>>1;
			if(gt(i,mid)==ht[mid-i+1]){
				as=mid;
				l=mid+1;
			}else r=mid-1;
		}nxt[i]=as;
	}for(int i=n+1;i<=n+7;i++)
		nxt[i]=i;
	for(int i=n;i;i--){
		int to=nxt[i]+2,l=to,r=n,as=l-1;
		while(l<=r){
			int mid=(l+r)>>1;
			if(gt(to,mid)==gt2(to-i+1,mid-i+1)){
				as=mid;
				l=mid+1;
			}else r=mid-1;
		}nxt[i]=as;
		nxt[i]=min(nxt[i],min(n,i+m-1));
	}dp[0]=dp2[0]=1;
	for(int i=0;i<=n;i++){
		int l=i+1,r=min(n,nxt[i+1]);
		cdp[i]+=cdp[i-1],cdp2[i]+=cdp2[i-1],cans[i]+=cans[i-1];
		cdp[i]%=mod,cdp2[i]%=mod,cans[i]%=mod;
		dp[i]=(dp[i]+cdp[i])%mod,dp2[i]=(dp2[i]+cdp2[i])%mod,ans[i]=(ans[i]+cans[i])%mod;
		if(i==n)break;
		cdp[l]=(cdp[l]+dp[i])%mod;
		cdp[r+1]=(cdp[r+1]+mod-dp[i])%mod;
		cdp2[l]=(cdp2[l]+dp2[i]+2*dp[i])%mod;
		cdp2[r+1]=(cdp2[r+1]-dp2[i]-2*dp[i]+mod+mod+mod)%mod;
		cans[l]=(cans[l]+dp2[i]+ans[i])%mod;
		cans[r+1]=(cans[r+1]-dp2[i]-ans[i]+mod+mod)%mod;
		// for(int j=l;j<=r;j++){
			// dp[j]=(dp[j]+dp[i])%mod;
			// dp2[j]=(dp2[j]+dp2[i]+2*dp[i])%mod;
			// ans[j]=(ans[j]+dp2[i]+ans[i])%mod;
		// }
	}cout<<ans[n]<<"\n";
	return 0;
}