#include <bits/stdc++.h>

#define el '\n'
#define ll long long
#define ld long double

#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

const int N = 1e5 + 5, K = 50 + 5, M = 1e9 + 7;

int add(int a, int b) {
    a = (a % M + M) % M;
    b = (b % M + M) % M;

    return (a + b) % M;
}

int id = 1;
string s, t;
int dp[N][K];
int vis[N][K];

int solve(int i, int j) {
    if (i > s.size())
        return j == t.size();

    int &ret = dp[i][j];

    if (vis[i][j] == id)
        return ret;

    vis[i][j] = id;

    ret = solve(i + 1, j);

    if (j < t.size() && s[i] == t[j])
        ret = add(ret, solve(i + 1, j + 1));

    return ret;
}

void testCase() {
    cin >> s >> t;

    set<string> sts;
    for (int i = 0; i < t.size(); i++) {
        sts.insert(t);

        char c = t.back();

        t.pop_back();

        t = c + t;
    }

    int sol = 0;
    for (auto i: sts) {
        t = i;

        sol = add(sol, solve(0, 0));

        id++;
    }

    cout << sol;
}

signed main() {
    Beevo

    int T = 1;
//    cin >> T;

    while (T--)
        testCase();

    return 0;
}