#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, const U &b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, const U &b) {
  if (a < b) a = b;
}
template <class 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 T1, class T2>
inline void gn(T1 &x1, T2 &x2) {
  gn(x1), gn(x2);
}
template <class T1, class T2, class T3>
inline void gn(T1 &x1, T2 &x2, T3 &x3) {
  gn(x1, x2), gn(x3);
}
template <class 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 <class T>
inline void println(T first) {
  print(first);
  putchar('\n');
}
template <class T>
inline void printsp(T first) {
  print(first);
  putchar(' ');
}
template <class T1, class T2>
inline void print(T1 x1, T2 x2) {
  printsp(x1), println(x2);
}
template <class T1, class T2, class T3>
inline void print(T1 x1, T2 x2, T3 x3) {
  printsp(x1), printsp(x2), println(x3);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = (long long)a * a % m)
    if (b & 1) ans = (long long)ans * a % m;
  return ans;
}
char s[100010], t[100010];
int h[100010], f[100010];
int n, N, H;
int calc(int first) {
  return (h[first] - (long long)h[first - n] * f[n] % 1000000007 + 1000000007) %
         1000000007;
}
int dp[100010], ans[100010], sum[100010];
int main() {
  f[0] = 1;
  for (int i = 1; i < 100010; i++) f[i] = 29LL * f[i - 1] % 1000000007;
  scanf("%s %s", s + 1, t + 1);
  N = strlen(s + 1), n = strlen(t + 1);
  for (int i = 1; i <= n; i++) {
    H = (29LL * H + t[i] - 'a' + 1) % 1000000007;
  }
  for (int i = 1; i <= N; i++) {
    h[i] = (29LL * h[i - 1] + s[i] - 'a' + 1) % 1000000007;
  }
  for (int i = n; i <= N; i++) {
    if (calc(i) == H)
      dp[i] = (sum[i - n] + i - n + 1) % 1000000007;
    else
      dp[i] = dp[i - 1];
    ans[i] = (ans[i - 1] + dp[i]) % 1000000007;
    sum[i] = (sum[i - 1] + ans[i]) % 1000000007;
  }
  println(ans[N]);
}
