#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=2e6+5,M=(1<<28)+5,K=1000+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
char s[N],t[N];
int n,m,id[N];
const ll i2=(mod+1)>>1,i6=(mod+1)/6;
ll f[5][5],g[5][5];
ll Y[6];
ll mpow(ll x,int y=mod-2){ll ans=1;while(y) y&1&&(ans=ans*x%mod),y>>=1,x=x*x%mod;return ans;}
namespace LGLR{
	ll Z[6];
	void init(){
		for(int i=0;i<=5;i++){
			Z[i]=1;
			for(int j=0;j<=5;j++) if(i^j) (Z[i]*=i-j)%=mod;
			Z[i]=mpow(Z[i]);
		}
	}
	ll qry(int k){
		ll ans=0;
		for(int i=0;i<=5;i++){
			ll a1=Y[i]*Z[i]%mod;
			for(int j=0;j<=5;j++) if(i^j) (a1*=k-j)%=mod;
			ans+=a1;
		}
		return ans%mod;
	}
}
namespace SAM{
	int son[N][27],link[N],len[N],cnt=1,La=1;
	void extend(int c){
		len[++cnt]=len[La]+1;int p=La;La=cnt;
		while(p&&!son[p][c]) son[p][c]=La,p=link[p];
		if(!p){link[La]=1;return;}
		int q=son[p][c];
		if(len[q]==len[p]+1){link[La]=q;return;}
		len[++cnt]=len[p]+1;link[cnt]=link[q];Mc(son[cnt],son[q]);link[q]=link[La]=cnt;
		while(p&&son[p][c]==q) son[p][c]=cnt,p=link[p];
	}
	vector<int> S[N];
	int pl[N];
	ll f[N][5],sum[N];
	ll calc(ll *f,int len){
		ll ans=0;
		for(int j=4;~j;j--){
			(ans*=len)%=mod;
			for(int i=0;i<=4;i++) if(g[i][j]) ans+=g[i][j]*f[i];
			ans%=mod;
		}
		return ans%mod;
	}
	void dfs(int x,int La){
		if(pl[x]){
			for(int i=f[x][0]=1;i<=4;i++) f[x][i]=f[x][i-1]*pl[x]%mod;
		}
		for(int i:S[x]){
			dfs(i,x);
			for(int j=0;j<=4;j++) (f[x][j]+=f[i][j])%=mod; 
		}
		for(int i=1;i<=5;i++) Y[i]=(calc(f[x],i-1)+Y[i-1])%mod;
		sum[x]=LGLR::qry(len[x])-LGLR::qry(len[La]);
		// for(int i=len[La]+1;i<=len[x];i++) (sum[x]+=calc(f[x],i-1))%=mod;
	}
	void make(int x){
		for(int i:S[x]) (sum[i]+=sum[x])%=mod,make(i);
	}
	void build(){
		for(int i=2;i<=cnt;i++) S[link[i]].push_back(i);
		dfs(1,0);make(1);
	}
}
void mul(ll a,ll b,ll c){
	for(int i=4;~i;i--){
		for(int j=4;~j;j--){
			if(i^4) (f[i+1][j]+=f[i][j]*a)%=mod;
			if(j^4) (f[i][j+1]+=f[i][j]*b)%=mod;
			(f[i][j]*=c)%=mod;
		}
	}
}
void add(){
	for(int i=0;i<=4;i++) for(int j=0;j<=4;j++) (g[i][j]+=f[i][j])%=mod,f[i][j]=0;
	f[0][0]=1;
}
void Solve(){

	scanf("%s%s",s+1,t+1);
	n=strlen(s+1);m=strlen(t+1);
	for(int i=1;i<=n;i++) SAM::extend(s[i]-'a'),SAM::pl[SAM::La]=i;
	SAM::extend(26);
	for(int i=1;i<=m;i++) SAM::extend(t[i]-'a'),id[i]=SAM::La;
	
	add();mul(1,0,-1);mul(1,0,0);mul(2,0,-1);mul(0,0,-i6);(f[0][0]+=1ll*n*(n+1)*(2*n+1)/6)%=mod;mul(1,-1,0);
	add();mul(-1,0,n+1);mul(1,-1,-1);mul(1,-1,0);mul(2,-2,-1);mul(0,0,i6);
	add();mul(1,0,n);mul(-1,0,n+1);mul(0,0,-i2);mul(1,-1,-1);mul(1,-1,0);
	add();LGLR::init();

	SAM::build();
	ll ans=0;
	for(int i=1;i<=m;i++) ans+=SAM::sum[id[i]];
	printf("%lld\n",(ans%mod+mod)%mod);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}