#include <bits/stdc++.h>
using namespace std;
constexpr int MOD = 998244353;
struct mint {
 private:
  long long x;

 public:
  mint(long long x = 0) : x((MOD + x) % MOD) {}
  mint(std::string& s) {
    long long z = 0;
    for (int i = 0; i < s.size(); i++) {
      z *= 10;
      z += s[i] - '0';
      z %= MOD;
    }
    this->x = z;
  }
  mint& operator+=(const mint& a) {
    if ((x += a.x) >= MOD) x -= MOD;
    return *this;
  }
  mint& operator-=(const mint& a) {
    if ((x += MOD - a.x) >= MOD) x -= MOD;
    return *this;
  }
  mint& operator*=(const mint& a) {
    (x *= a.x) %= MOD;
    return *this;
  }
  mint& operator/=(const mint& a) {
    long long n = MOD - 2;
    mint u = 1, b = a;
    while (n > 0) {
      if (n & 1) {
        u *= b;
      }
      b *= b;
      n >>= 1;
    }
    return *this *= u;
  }
  mint operator+(const mint& a) const {
    mint res(*this);
    return res += a;
  }
  mint operator-(const mint& a) const {
    mint res(*this);
    return res -= a;
  }
  mint operator*(const mint& a) const {
    mint res(*this);
    return res *= a;
  }
  mint operator/(const mint& a) const {
    mint res(*this);
    return res /= a;
  }
  friend std::ostream& operator<<(std::ostream& os, const mint& n) {
    return os << n.x;
  }
  bool operator==(const mint& a) const { return this->x == a.x; }
};
template <typename T, typename U>
T pow(T k, U n, T unity = 1) {
  while (n > 0) {
    if (n & 1) {
      unity *= k;
    }
    k *= k;
    n >>= 1;
  }
  return unity;
}
int main() {
  string s, t;
  cin >> s >> t;
  vector<vector<mint> > dp(s.size(), vector<mint>(t.size(), 0));
  for (int i = 0; i < t.size(); i++) {
    if (s[0] == t[i]) dp[0][i] = 2;
  }
  for (int i = 1; i < s.size(); i++) {
    for (int j = 0; j < t.size(); j++) {
      if (t[j] == s[i]) {
        if (j == t.size() - 1)
          dp[i][j] += pow(mint(2), i);
        else
          dp[i][j] += dp[i - 1][j + 1];
      }
      if (i + j >= t.size() || s[i] == t[i + j]) {
        dp[i][j] += dp[i - 1][j];
      }
    }
  }
  mint ans = 0;
  for (int i = t.size() - 1; i < s.size(); i++) {
    ans += dp[i][0];
  }
  cout << ans << endl;
  return 0;
}
