#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;

#ifdef local
#define safe std::cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define debug(args...) qqbx(#args, args)
#define orange(args...) danb(#args, args)
using std::cerr;
template <typename ...T> void qqbx(const char *s, T ...args) {
  int cnt = sizeof...(T);
  ((cerr << "\e[1;32m(" << s << ") = ("), ..., (cerr << args << (--cnt ? ", " : ")\e[0m\n")));
}
template <typename I> void danb(const char *s, I L, I R) {
  cerr << "\e[1;32m[ " << s << " ] = [ ";
  for (int f = 0; L != R; ++L) cerr << (f++ ? ", " : "") << *L;
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) ((void)0)
#define orange(...) ((void)0)
#endif // local
#define all(v) begin(v),end(v)

using lld = int64_t;

const int mod = 998244353;

vector<int> Zalgo(const string &s) {
  vector<int> z(s.size(), s.size());
  for (int i = 1, l = 0, r = 0; i < z[0]; ++i) {
    int j = clamp(r - i, 0, z[i - l]);
    for (; i + j < z[0] and s[i + j] == s[j]; ++j);
    if (i + (z[i] = j) > r) r = i + z[l = i];
  }
  return z;
}

class Hash {
  private:
    static constexpr int P = 127, Q = 1051762951;
    static int add(int a, int b) {
      return a + b >= Q ? a + b - Q : a + b;
    }
    static int sub(int a, int b) {
      return a - b < 0 ? a - b + Q : a - b;
    }
    static int mul(int64_t a, int64_t b) {
      return static_cast<int>(a * b % Q);
    }
    vector<int> h, p;
  public:
    void init(const string &s) {
      h.assign(s.size() + 1, 0);
      p.resize(s.size() + 1);
      for (size_t i = 0; i < s.size(); ++i)
        h[i + 1] = add(mul(h[i], P), s[i]);
      generate(p.begin(), p.end(), [x=1,y=1,this]() mutable{y=x;x=mul(x,P); return y;});
    }
    int query(int l, int r) {
      return sub(h[r], mul(h[l], p[r-l]));
    }
};

int modadd(int a, int b) {
  return a + b >= mod ? a + b - mod : a + b;
}
int modsub(int a, int b) {
  return a - b < 0 ? a - b + mod : a - b;
}
int modmul(int64_t a, int64_t b) {
  return static_cast<int>(a * b % mod);
}

signed main() {
  ios_base::sync_with_stdio(0), cin.tie(0);

  string S, T;
  cin >> S >> T;

  string A = T + '$' + S;
  auto z = Zalgo(A);


  Hash ht; ht.init(T);
  Hash hs; hs.init(S);

  vector<int> s0(S.size() + 2), s1(S.size() + 2), s2(S.size() + 2);
  s0[0] = 1;
  s0[1] = mod - 1;

  for (size_t i = 0; i < S.size(); i++) {
    int len = z[i + T.size() + 1];
    debug(len);

    if (len < T.size() && i + len < S.size()) {
      const int X = len + 1;
      const int Y = i + len + 1;

      int a = 0;
      for (int s = 1<<20; s; s >>= 1) {
        if (X + a + s <= T.size() && Y + a + s <= S.size() &&
            ht.query(X, X + a + s) ==
            hs.query(Y, Y + a + s)) {
          a += s;
        }
      }
      len = X + a;
    }

    debug(len, S.substr(i));
    assert (i + len <= S.size());

    if (i) {
      s0[i] = modadd(s0[i], s0[i - 1]);
      s1[i] = modadd(s1[i], s1[i - 1]);
      s2[i] = modadd(s2[i], s2[i - 1]);
    }

    const auto add = [&](auto &p, int l, int r, int v) {
      if (l >= r) return;
      p[l] = modadd(p[l], v);
      p[r] = modsub(p[r], v);
    };

    add(s0, i + 1, i + len + 1, s0[i]);
    add(s1, i + 1, i + len + 1, modadd(s1[i], s0[i]));
    add(s2, i + 1, i + len + 1, modadd(modadd(s2[i], modadd(s1[i], s1[i])), s0[i]));
  }

  {
    size_t i = S.size();
    s0[i] = modadd(s0[i], s0[i - 1]);
    s1[i] = modadd(s1[i], s1[i - 1]);
    s2[i] = modadd(s2[i], s2[i - 1]);
  }

  cout << s2[S.size()] << '\n';

}