#include "bits/stdc++.h"

using namespace std;
#define int long long
const int N = 1e5 + 1, M = 51, mod = 1000000007;
int dp[N][M];
string s, t;
int n, m;

int solve(int p1, int p2) {
    int &ret = dp[p1][p2];
    if (~ret)return ret;
    if (p1 == n) {
        return p2 == m;
    }
    ret = solve(p1 + 1, p2);
    if (p2 < m and s[p1] == t[p2])
        ret = (ret + solve(p1 + 1, p2 + 1)) % mod;
    return ret;
}

signed main() {
    memset(dp, -1, sizeof dp);
    cin >> s >> t;
    vector<int> pos;
    int cnt = 0;
    n = s.size(), m = t.size();
    map<string, int> found;
    for (int i = 0; i < m; i++) {
        memset(dp, -1, sizeof dp);
        if (!found[t])
            cnt = (cnt + solve(0, 0)) % mod;
        found[t] = 1;
        t = t.back() + t;
        t.pop_back();
    }
    cout << cnt << endl;
}