#include <bits/stdc++.h>
using namespace std;
unsigned long long min(unsigned long long x, unsigned long long y) {
  if (x < y) return x;
  return y;
}
unsigned long long max(unsigned long long x, unsigned long long y) {
  if (x < y) return y;
  return x;
}
long long min(long long x, long long y) {
  if (x < y) return x;
  return y;
}
long long max(long long x, long long y) {
  if (x < y) return y;
  return x;
}
double min(double x, double y) {
  if (x < y) return x;
  return y;
}
double max(double x, double y) {
  if (x < y) return y;
  return x;
}
unsigned long long gcd(unsigned long long x, unsigned long long y) {
  if (!x) return y;
  if (!y) return x;
  if (x > y) swap(x, y);
  return gcd(x, y % x);
}
unsigned long long inv(unsigned long long a, unsigned long long c) {
  if (a == 1) {
    return 1;
  }
  return ((c - (c / a)) * inv(c % a, c)) % c;
}
long long n, m, M = 998244353, dp[3005][3005] = {0}, ans = 0;
string s, t;
void mod(long long &a) {
  if (a >= M) a -= M;
  if (a < 0) a += M;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> s >> t;
  n = (long long)s.size();
  m = (long long)t.size();
  dp[n][0]++;
  for (int i = n - 1; i >= 0; i--) {
    for (int j = 0; j <= n - i; j++) {
      if ((j > 0) && ((j > m) || (s[i] == t[j - 1]))) {
        dp[i][j] += dp[i + 1][j - 1];
        mod(dp[i][j]);
      }
      if ((i + j >= m) || (s[i] == t[i + j])) {
        dp[i][j] += dp[i + 1][j];
        mod(dp[i][j]);
      }
      if ((j == 0) && (i >= m)) {
        dp[i][j]++;
        mod(dp[i][j]);
      }
    }
  }
  for (int j = 0; j <= n; j++) {
    ans += dp[0][j];
    mod(ans);
  }
  cout << ans << "\n";
  return 0;
}
