One day Polycarpus got hold of two non-empty strings s and t, consisting of lowercase Latin letters. Polycarpus is quite good with strings, so he immediately wondered, how many different pairs of "x y" are there, such that x is a substring of string s, y is a subsequence of string t, and the content of x and y is the same. Two pairs are considered different, if they contain different substrings of string s or different subsequences of string t. Read the whole statement to understand the definition of different substrings and subsequences.

The length of string s is the number of characters in it. If we denote the length of the string s as |s|, we can write the string as s = s1s2... s|s|.

A substring of s is a non-empty string x = s[a... b] = sasa + 1... sb (1 ≤ a ≤ b ≤ |s|). For example, "code" and "force" are substrings or "codeforces", while "coders" is not. Two substrings s[a... b] and s[c... d] are considered to be different if a ≠ c or b ≠ d. For example, if s="codeforces", s[2...2] and s[6...6] are different, though their content is the same.

A subsequence of s is a non-empty string y = s[p1p2... p|y|] = sp1sp2... sp|y| (1 ≤ p1 < p2 < ... < p|y| ≤ |s|). For example, "coders" is a subsequence of "codeforces". Two subsequences u = s[p1p2... p|u|] and v = s[q1q2... q|v|] are considered different if the sequences p and q are different.

Input

The input consists of two lines. The first of them contains s (1 ≤ |s| ≤ 5000), and the second one contains t (1 ≤ |t| ≤ 5000). Both strings consist of lowercase Latin letters.

Output

Print a single number — the number of different pairs "x y" such that x is a substring of string s, y is a subsequence of string t, and the content of x and y is the same. As the answer can be rather large, print it modulo 1000000007 (109 + 7).

Examples

Input

aa
aa


Output

5


Input

codeforces
forceofcode


Output

60

Note

Let's write down all pairs "x y" that form the answer in the first sample: "s[1...1] t[1]", "s[2...2] t[1]", "s[1...1] t[2]","s[2...2] t[2]", "s[1...2] t[1 2]".
#include <bits/stdc++.h>
int faster_in() {
  int r = 0, c;
  for (c = getchar(); c <= 32; c = getchar())
    ;
  if (c == '-') return -faster_in();
  for (; c > 32; r = (r << 1) + (r << 3) + c - '0', c = getchar())
    ;
  return r;
}
using namespace std;
const int INF = 1234567890;
const long long mod = 1e9 + 7;
string s, t;
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> s >> t;
  int n = s.size();
  int m = t.size();
  long long dp[m], lastDP[m];
  long long pref[m];
  memset(lastDP, (0), sizeof(lastDP));
  memset(pref, (0), sizeof(pref));
  long long res = 0;
  for (int i = n - 1; i >= 0; --i) {
    for (int j = (int)0, o_o = m; j < (int)o_o; ++j) {
      long long &x = dp[j];
      x = 0;
      if (s[i] == t[j]) {
        x += 1;
        if (j + 1 < m) x += pref[j + 1];
        x %= mod;
      }
      lastDP[j] = x;
      res = (res + x) % mod;
    }
    for (int j = m - 1; j >= 0; j--) {
      pref[j] = lastDP[j];
      if (j + 1 < m) pref[j] += pref[j + 1];
      pref[j] %= mod;
    }
  }
  cout << res << '\n';
  return 0;
}
