#include<bits/stdc++.h>
#define ll long long
#define el '\n'
#define all(a) a.begin(),a.end()

#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

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>;
const ll N=1e5+5,mod=1e9+7;

vector<string> get_all_rotations(string str)
{
    vector<string> vec;
    vec.push_back(str);

    unordered_map<string , bool> mp = {};
    mp[str] = true;

    deque<char> dq;
    for (char c : str) dq.push_back(c);

    ll ii = 1;
    while(true)
    {

        if (ii == str.size() + 10) {break;}
        char c  = dq.front();
        dq.pop_front();

        dq.push_back(c);
        string curr_str = "";
        for (ll i = 0 ; i < dq.size() ; i++)
        {
            curr_str += dq[i];
        }

        if (!mp[curr_str])
        {
            vec.push_back(curr_str);
            mp[curr_str] = true;
        }
        ii++;
    }

    return vec;
}
string str , ask;
ll get_count( string& s)
{
    ll m = str.size(), n = s.size();
    vector<ll> count(n, 0);

    for (ll i = 0; i < m; i++)
    {
        for (ll j = n - 1; j >= 0; j--)
        {
            if (str[i] == s[j])
            {
                count[j] += (j == 0 ? 1 : count[j - 1]);
                count[j] %= mod;
            }
        }
    }

    return count[n - 1];
}


void solve(ll t) {

    cin >> str >> ask;

    vector<string> options = get_all_rotations(ask);

    ll ans = 0;
    for (string s : options)
    {
        // get count of subsequences in str that is equal to s
        ans += get_count(s) % mod;
        ans %= mod;
    }

    cout << ans % mod;
}
int main() {
    ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);

    ll t;
    //cin >> t;
    t = 1;
    for (ll i = 0 ; i < t ; i ++)
    {
        solve(t);
    }
}