#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e6 + 10, mod = 998244353, base = 31;

int n, m;
int nxt[N];
ll dp[N], sum[N], cnt[N];
string s, t;

void init() {
   cin >> s >> t;
}

struct Hash {
   int mod, len;
   ll pw[N], hs[N];

   void build(string st) {
      pw[0] = 1;
      for(int i = 1; i <= st.size() - 1; ++i) {
         pw[i] = pw[i - 1] * base % mod;
         hs[i] = (hs[i - 1] * base + st[i] - 'a' + 1) % mod;
      }
   }

   ll get(int f, int l) {
      return (hs[l] - hs[f - 1] * pw[l - f + 1] + 1ll * mod * mod) % mod;
   }
};
Hash hs1, ht1;
Hash hs2, ht2;

ll get_hash(bool ok, int f, int l) {
   int mod_base = 1e9 + 10;
   if(ok) {
      return hs1.get(f, l) * mod_base + hs2.get(f, l);
   }
   return ht1.get(f, l) * mod_base + ht2.get(f, l);
}

int dis(int i, int j) {
   int f = 1, l = min(n - i + 1, m - j + 1);
   int ans = 0;

   while(f <= l) {
      int mid = f + l >> 1;
      if(get_hash(1, i, i + mid - 1)
            == get_hash(0, j, j + mid - 1)) {
         ans = mid;
         f = mid + 1;
      }
      else l = mid - 1;
   }

   return ans;
}

void add(ll &x, ll y) {
   x += y;
   if(x < 0) x += mod;
   if(x >= mod) x -= mod;
}

int main () {
   cin.tie(0) -> sync_with_stdio(0);
   if(fopen("Task.inp", "r")) {
      freopen("Task.inp", "r", stdin);
      freopen("WA.out", "w", stdout);
   }

   init();

   n = s.size(); s = " " + s;
   m = t.size(); t = " " + t;

   hs1.mod = ht1.mod = 1e9 + 7;
   hs2.mod = ht2.mod = 1e9 + 1;
   hs1.build(s); hs2.build(s);
   ht1.build(t); ht2.build(t);

   for(int i = 1; i <= n; ++i) {
      int d = dis(i, 1);

      if(d == m) nxt[i] = i + m - 1;
      else if(i + d - 1 == n) nxt[i] = n;
      else {
         d++;
         nxt[i] = i + d + dis(i + d, 1 + d) - 1;
      }
   }

   dp[1] = cnt[1] = sum[1] = 1;
   dp[nxt[1] + 1] = cnt[nxt[1] + 1] = sum[nxt[1] + 1] = -1 + mod;
   for(int i = 1; i <= n; ++i) {
      add(dp[i], dp[i - 1]);
      add(cnt[i], cnt[i - 1]);
      add(sum[i], sum[i - 1]);

      if(n - i) {
         ll valdp = (dp[i] + 2 * sum[i] + cnt[i]) % mod;
         ll valsum = (sum[i] + cnt[i]) % mod;

         add(dp[i + 1], valdp);
         add(dp[nxt[i + 1] + 1], - valdp);

         add(sum[i + 1], valsum);
         add(sum[nxt[i + 1] + 1], - valsum);

         add(cnt[i + 1], cnt[i]);
         add(cnt[nxt[i + 1] + 1], - cnt[i]);
      }
   }

   cout << dp[n];
}