#include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef long double ld;
#define F first
#define S second
const int N = 1e5 + 2, mod = 1e9 + 7;
const ld eps = 1e-6;
int grid[57][57];
typedef complex<ld> point;
#define X real()
#define Y imag()
string s, t;
int dp[N][50];
int add(int x, int y) {
    return (x + y) % mod;
}
int solve(int i, int j) {
    if (j == t.size())
        return 1;
    if (i == s.size())
        return 0;
    if (~dp[i][j])
        return dp[i][j];
    int val = solve(i + 1, j);
    if (s[i] == t[j])
        val = add(val, solve(i + 1, j + 1));
    return dp[i][j] = val;
}
int main() {
    cin >> s >> t;
    int ans = 0;
    set<string> st;
    for (int i = 0; i < t.size(); i++) {
        t = t.back() + t;
        t.pop_back();
        memset(dp, -1, sizeof dp);
        if (!st.count(t))
            ans = add(ans, solve(0, 0));
        st.insert(t);
    }
    cout << ans;
    return 0;
}