#include<bits/stdc++.h>
using namespace std;
using ll=long long;
template<typename T>
ostream& operator << (ostream &out,const vector<T>&x){
	if(x.empty())return out<<"[]";
	out<<'['<<x[0];
	for(int len=x.size(),i=1;i<len;i++)out<<','<<x[i];
	return out<<']';
}
template<typename T>
vector<T> ary(const T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
template<typename T>
void debug(T x){
	cerr<<x<<'\n';
}
template<typename T,typename ...S>
void debug(T x,S ...y){
	cerr<<x<<' ',debug(y...);
}
const int N=2e5+10,M=55,mod=1e9+7;
int n,m,f[N][M],p[M];
char a[N],b[M],c[M];
bool cmp(int i,int j){
	for(int k=1;k<=m;k++,i=i%m+1,j=j%m+1){
		if(b[i]^b[j])return b[i]<b[j];
	}
	return 0;
}
int ans;
void solve(){
	// debug(b+1);
	memset(f,0,sizeof f);
	f[0][0]=1;
	for(int i=1;i<=n;i++){
		for(int j=0;j<=m;j++){
			f[i][j]=(f[i-1][j]+(a[i]==b[j]?f[i-1][j-1]:0))%mod;
		}
	}
	(ans+=f[n][m])%=mod;
}
int main(){
	scanf("%s%s",a+1,b+1),n=strlen(a+1),m=strlen(b+1);
	iota(p,p+1+m,0),sort(p+1,p+1+m,cmp);
	// debug(ary(p,1,m));
	int cnt=1;
	for(int i=2;i<=m;i++){
		if(cmp(p[cnt],p[i]))p[++cnt]=p[i];
	}
	// debug(ary(p,1,cnt));
	for(int i=1;i<=cnt;i++){
		memcpy(c,b,sizeof b);
		rotate(b+1,b+p[i],b+1+m);
		solve();
		memcpy(b,c,sizeof b);
	}
	cout<<ans<<endl;
	return 0;
}