#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define debug(x) cerr << #x << " is " << x << endl;
#define FastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define endl '\n'
#define pb push_back
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define ll long long
#define one(x) __builtin_popcount(x)
#define ld long double
#define sz(x) x.size()
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,
tree_order_statistics_node_update> indexed_set;
const int N = 2e5 + 5, mod = 1e9 + 7;
string s, t;
map<string, bool> vis;
int dp[N][55];
int solve(int i, int j){
    if(j == t.size()){
        return 1;
    }
    if(i == s.size()){
        return 0;
    }
    int &ret = dp[i][j];
    if(~ret){
        return ret;
    }
    ret = solve(i + 1, j);
    if(s[i] == t[j]){
        ret = (ret + solve(i + 1, j + 1)) % mod;
    }
    return ret;
}
void doWork(){
    cin >> s >> t;
    int answer = 0;
    for(int i = 0; i < sz(t); ++i){
        string x = "";
        x += t.back();
        t.pop_back();
        t = x + t;
        if(vis[t]){
            continue;
        }
        vis[t] = 1;
        memset(dp, -1, sizeof(dp));
        answer = (answer + solve(0, 0)) % mod;
    }
    cout << answer << endl;
}
int32_t main(){
    FastIO
    int tc = 1;
    //cin >> tc;
    while(tc--){
        doWork();
    }
    return 0;
}