#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline string toString(T a) {
  ostringstream os("");
  os << a;
  return os.str();
}
template <typename T>
inline long long toLong(T a) {
  long long res;
  istringstream os(a);
  os >> res;
  return res;
}
template <typename T>
inline T SQ(T a) {
  return a * a;
}
template <typename T>
inline T gcd(T a, T b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
template <typename T>
inline unsigned long long bigmod(T a, T b, T m) {
  if (b == 0)
    return 1;
  else if (b % 2 == 0)
    return SQ(bigmod(a, b / 2, m)) % m;
  else
    return (a % m * bigmod(a, b - 1, m)) % m;
}
template <typename T>
inline vector<string> parse(T str) {
  vector<string> res;
  string s;
  istringstream os(str);
  while (os >> s) res.push_back(s);
  return res;
}
template <typename T>
inline unsigned long long dist(T A, T B) {
  unsigned long long res =
      (A.x - B.x) * (A.x - B.x) + (A.y - B.y) * (A.y - B.y);
  return res;
}
template <typename T>
inline double cosAngle(T a, T b, T c) {
  double res = a * a + b * b - c * c;
  res = res / (2 * a * b);
  res = acos(res);
  return res;
}
template <typename T>
inline T power(T base, int po) {
  T res = 1;
  if (base == 0) return 0;
  for (int i = (0); i < (po); i++) res *= base;
  return res;
}
template <typename T>
inline bool isOn(T mask, T pos) {
  return mask & (1 << pos);
}
template <typename T>
inline int Off(T mask, T pos) {
  return mask ^ (1 << pos);
}
template <typename T>
inline int On(T mask, T pos) {
  return mask | (1 << pos);
}
char S[100005], T[100005];
int match[100005];
int arr[100005];
long long dp[100005], sum[100005], cum[100005];
int main() {
  int i, j, k;
  int x, y;
  scanf("%s", S);
  scanf("%s", T);
  int slen = strlen(S);
  int tlen = strlen(T);
  for (i = 1; i < tlen; i++) {
    j = match[i - 1];
    while (j > 0 && T[i] != T[j]) j = match[j - 1];
    if (T[i] == T[j]) j++;
    match[i] = j;
  }
  i = 0, j = 0;
  while (i < slen) {
    if (S[i] == T[j]) {
      j++;
      i++;
    }
    if (j == tlen) {
      arr[i - j] = 1;
      j = match[j - 1];
    } else if (i < slen && S[i] != T[j]) {
      if (j != 0)
        j = match[j - 1];
      else
        i++;
    }
  }
  long long last = 0;
  for (i = slen - 1; i >= 0; i--) {
    if (arr[i]) {
      dp[i] = slen - i - tlen + 1;
      dp[i] += cum[i + tlen];
      dp[i] %= 1000000007;
      last = dp[i];
    } else {
      dp[i] = dp[i + 1];
    }
    sum[i] = (sum[i] + sum[i + 1] + dp[i]) % 1000000007;
    cum[i] = (sum[i] + cum[i + 1]) % 1000000007;
    sum[i] %= 1000000007;
  }
  cout << sum[0] << endl;
}
