#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
using namespace std;
template <typename T>
void etch(T V) {
  for (auto x : V) cout << x << ' ';
  cout << '\n';
}
vector<string> vec_splitter(string s) {
  s += ',';
  vector<string> res;
  while (!s.empty()) {
    res.push_back(s.substr(0, s.find(',')));
    s = s.substr(s.find(',') + 1);
  }
  return res;
}
void debug_out(vector<string> __attribute__((unused)) args,
               __attribute__((unused)) long long int idx,
               __attribute__((unused)) long long int LINE_NUM) {
  cerr << endl;
}
template <typename Head, typename... Tail>
void debug_out(vector<string> args, long long int idx, long long int LINE_NUM,
               Head H, Tail... T) {
  if (idx > 0)
    cerr << ", ";
  else
    cerr << "Line(" << LINE_NUM << ") ";
  stringstream ss;
  ss << H;
  cerr << args[idx] << " = " << ss.str();
  debug_out(args, idx + 1, LINE_NUM, T...);
}
const long long int MOD = 998244353;
const long long int N = 2e5 + 5;
const long long int INF = 1000111000111000111LL;
const long double EPS = 1e-12;
const long double PI = 3.141592653589793116;
void add(long long int& a, long long int b) {
  a += b;
  if (a >= MOD) a -= MOD;
}
long long int dp[3005][3005];
int32_t main() {
  std::ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  string second, T;
  cin >> second >> T;
  long long int n = (long long int)((second).size()),
                m = (long long int)((T).size());
  memset(dp, 0, sizeof dp);
  for (long long int i = 0; i < n; i++) {
    if (i >= m or second[0] == T[i]) dp[1][i] = 2;
  }
  for (long long int i = 2; i <= n; i++) {
    for (long long int j = 0; j < n; j++) {
      if (j > 0 && j - 1 < m && T[j - 1] == second[i - 1]) {
        add(dp[i][j - 1], dp[i - 1][j]);
      } else if (j - 1 >= m) {
        add(dp[i][j - 1], dp[i - 1][j]);
      }
      if (j + i - 1 >= m) {
        add(dp[i][j], dp[i - 1][j]);
      } else if (j + i - 1 < m and T[j + i - 1] == second[i - 1]) {
        add(dp[i][j], dp[i - 1][j]);
      }
    }
  }
  long long int ans = 0;
  for (long long int i = m; i <= n; i++) add(ans, dp[i][0]);
  cout << ans;
  return 0;
}
