#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <typename T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <typename T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <typename T>
inline void println(T first) {
  print(first), putchar('\n');
}
template <typename T>
inline void printsp(T first) {
  print(first), putchar(' ');
}
template <class T, class T1>
inline void print(T first, T1 second) {
  printsp(first), println(second);
}
template <class T, class T1, class T2>
inline void print(T first, T1 second, T2 z) {
  printsp(first), printsp(second), println(z);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
char s[111111], t[111111];
long long f[111111], flag[111111];
long long hs[111111], ht[111111];
long long dp[111111], sum[111111], S[111111];
int T, n;
int calc(int ed, long long *tmp) {
  return (tmp[ed] - 1LL * f[T] * tmp[ed - T] % 1000000007 + 1000000007) %
         1000000007;
}
int main() {
  f[0] = 1;
  for (int i = 1; i < 111111; i++) f[i] = 29LL * f[i - 1] % 1000000007;
  scanf(" %s\n", s + 1);
  scanf(" %s", t + 1);
  n = strlen(s + 1);
  T = strlen(t + 1);
  ht[T + 1] = 0;
  for (int i = 1; i <= T; i++)
    ht[i] = (29LL * ht[i - 1] % 1000000007 + t[i] - 'a' + 1) % 1000000007;
  hs[n + 1] = 0;
  for (int i = 1; i <= n; i++)
    hs[i] = (29LL * hs[i - 1] % 1000000007 + s[i] - 'a' + 1) % 1000000007;
  for (int i = 1; i <= n; i++) {
    if (calc(i, hs) == ht[T]) flag[i] = 1;
  }
  for (int i = 1; i <= n; i++) {
    if (flag[i]) {
      dp[i] = (S[i - T] + i - T + 1) % 1000000007;
    } else
      dp[i] = dp[i - 1];
    sum[i] = (sum[i - 1] + dp[i]) % 1000000007;
    S[i] = (S[i - 1] + sum[i]) % 1000000007;
  }
  cout << sum[n] << endl;
}
