#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int mod = 1'000'000'007;

void updAdd(int& a, int b)
{
	a += b;
	if (a >= mod)
		a -= mod;
}

int ans = 0;
const int N = 100'447;
const int M = 74;

int dp[N][M];


void f(string s, string t)
{
	int n = SZ(s);
	int m = SZ(t);
	
	FOR (i, 0, n + 1)
		FOR (j, 0, m + 1)
			dp[i][j] = 0;
	dp[0][0] = 1;
	FOR (i, 0, n)
	{
		FOR (j, 0, m + 1)
		{
			if (j != m && s[i] == t[j])
				updAdd(dp[i + 1][j + 1], dp[i][j]);
			updAdd(dp[i + 1][j], dp[i][j]); 
		}
	}
	updAdd(ans, dp[n][m]);
}


int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	cout << fixed << setprecision(15);
	
	string s;
	string t;
	cin >> s >> t;
	
	set<string> was;
	
	FOR (i, 0, SZ(t))
	{
		string t2 = t.substr(i, SZ(t) - i);
		t2 += t.substr(0, i);
		if (!was.count(t2))
		{
			was.insert(t2);
			f(s, t2);
		}
		
	}
	cout << ans << '\n';
	
	return 0;
}