#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

#define el '\n'
#define Morsi ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;
using namespace __gnu_pbds;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// order_of_key ------> return index
// find_by_order -----> use index

//Best SQ = 150 -> test 21

const int mod = 1e9 + 7, N = 1e5 + 10, SQ = 150;
 
string s, sequence;
int length, dp[N][55];

int add(long long x, long long y){
    return (x + y) % mod;
}

int solve(int index, int matches){
    if(matches == length)
        return 1;

    if(index == s.size())
        return (matches == length);

    int &ret = dp[index][matches];
    if(~ret)
        return ret;

    ret = solve(index + 1, matches);

    if(s[index] == sequence[matches])
        ret = add(ret, solve(index + 1, matches + 1)); 

    return ret;
}

void alg() {
    cin >> s;
    cin >> sequence;
    length = sequence.size();
    set<string> st;
    for(int i = 0; i < length; i++){
        string temp;
        temp.push_back(sequence[i]);

        for(int j = (i + 1) % length; j != i; j = (j + 1) % length)
            temp.push_back(sequence[j]);

        st.insert(temp);
    }

    int ans = 0;

    for(auto &i : st){
        memset(dp, -1, sizeof dp);
        sequence = i;

        ans = add(ans, solve(0, 0));
    }

    cout << ans;
}

int main()
{
    Morsi
    int t = 1;
    while(t--){
        alg();
    }
    return 0;
}