#include <bits/stdc++.h>
using namespace std;
long long int mod = 998244353;
long double eps = 1e-12;
long long int dx[] = {0, 0, 1, -1};
long long int dy[] = {1, -1, 0, 0};
long long int m = 0, n, res = 0, k = 0, h;
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long int lcm(long long int x, long long int y) {
  return (x * y) / gcd(x, y);
}
string s2, ch = "", s, s1 = "", t;
vector<pair<string, long long int> > vm;
vector<pair<pair<long long int, long long int>, long long int> > vvvl, vvvr;
vector<pair<long long int, long long int> > vv, vv2;
vector<long long int> v[500005];
long long int a[500005], dp[3005][3005];
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  long long int i = 0, x = 0, z = 0, y = 0, j = 0, q, mx = 0, mm, idx = 0,
                ok = 0, l = 0, r = 0, negatif = 0, positif = 0, l1, r1, g = 0,
                d;
  set<long long int>::iterator it;
  string s, t;
  cin >> s >> t;
  n = s.size();
  k = t.size();
  while (t.size() < n) {
    t += '?';
  }
  m = s.size();
  memset(dp, 0, sizeof(dp));
  for (i = 0; i < m; i++) {
    if (t[i] == s[0] || t[i] == '?') {
      dp[i][i] = 2;
    }
  }
  long long int res = 0;
  for (j = 0; j < m; j++) {
    for (i = j - 1; i >= 0; i--) {
      l = (j - i);
      if (t[j] == s[l] || t[j] == '?') {
        dp[i][j] = (dp[i][j] + dp[i][j - 1] + mod) % mod;
      }
      if (t[i] == s[l] || t[i] == '?') {
        dp[i][j] = (dp[i][j] % mod + dp[i + 1][j] % mod + mod) % mod;
      }
    }
  }
  for (i = 0; i < m; i++) {
    if ((i + 1) >= k) {
      res = (res + dp[0][i] % mod) % mod;
    }
  }
  cout << res;
  return 0;
}
