//#pragma GCC optimize ("O3")

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

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
//#define int ll
typedef tree<
        pair<int, int>,
        null_type,
        less<pair<int, int>>,
        rb_tree_tag,
        tree_order_statistics_node_update>
        ordered_set;//order_of_key()->gives how many elements less than specific element in the set ,, find_by_order() ->find specific element by index the set
#define  ll long long
#define  el '\n'
#define IO       \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);

#define endl '\n'
using namespace std;
string s,t;
int dp[100001][51];
int mod=1000000007;
int id=1;
int vis[100001][51];
int solve(int i,int j)
{
    if(i>=s.size()||j>=t.size())
    {
        if(i==s.size()&&j==t.size())
            return 1;
        else if(j>=t.size())
            return 1;
        else
            return 0;
    }
    if(vis[i][j]==id)
        return dp[i][j];
    vis[i][j]=id;
    if(s[i]!=t[j])
    {
        return dp[i][j]=solve(i+1,j);
    }
    else
        return dp[i][j]= ((solve(i+1,j+1)%mod)+(solve(i+1,j)%mod))%mod;
}
signed main() {
    IO
    cin>>s>>t;
    unordered_set<string>st;
    for(int i=0;i<t.size();i++)
    {
        int j=i;
        int cnt=0;
        string a="";
        while(cnt<t.size())
        {
            a+=t[j];
            j++;
            j%=t.size();
            cnt++;
        }
        st.insert(a);
    }
    int ans=0;
    for(auto &it:st)
    {
        t=it;
        ans=((ans%mod)+(solve(0,0)%mod))%mod;
        id++;
        assert(id<100);
    }
   // aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa

    cout<<ans;
}