#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
const long long mod = 1e9 + 7;
const int maxn = 5e3 + 5;
long long dp[maxn][maxn];
string s, t;
int n, m;
long long foo(int i, int j) {
  if (i == n || j == m) return 0;
  if (dp[i][j] > -1) return dp[i][j];
  dp[i][j] = foo(i, j + 1);
  if (s[i] == t[j]) {
    dp[i][j] += 1 + foo(i + 1, j + 1);
    if (dp[i][j] >= mod) dp[i][j] -= mod;
  }
  return dp[i][j];
}
void solve() {
  memset(dp, -1, sizeof dp);
  cin >> s >> t;
  n = s.length(), m = t.length();
  long long ans = 0;
  for (int i = 0; i < n; i++) {
    ans += foo(i, 0);
    if (ans >= mod) ans -= mod;
  }
  cout << ans << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int t = 1;
  while (t--) solve();
  return 0;
}
