/*
Things to notice:
1. do not calculate useless values
2. do not use similar names
 
Things to check:
1. submit the correct file
2. time (it is log^2 or log)
3. memory
4. prove your naive thoughts 
5. long long
6. corner case like n=0,1,inf or n=m
7. check if there is a mistake in the ds or other tools you use
8. fileio in some oi-contest

9. module on time 
10. the number of a same divisor in a math problem
11. multi-information and queries for dp and ds problems
*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
const int mod=998244353;
const int inf=0x3f3f3f3f;
int z[10005];
string s;
void getz()
{
	memset(z,0,sizeof(z));
	for(int i=1,l=0,r=0;i<s.size();i++)
	{
		if(i<=r&&z[i-l]<r-i+1) z[i]=z[i-l];
		else
		{
			z[i]=max(0,r-i+1);
			while(i+z[i]<s.size()&&s[z[i]]==s[i+z[i]]) z[i]++;
		}
    	if(i+z[i]-1>r) l=i,r=i+z[i]-1;
	}
}
int cntlcp[5005][5005];
ll ans=0;
int lcs[5005];
void work(string S,string T,int tp)
{
	int n=S.size(),m=T.size();
	memset(cntlcp,0,sizeof(cntlcp));
	for(int i=0;i<m;i++)
	{
		s="";
		for(int j=i;j<m;j++) s+=T[j];
		s+=S;
		getz();
		for(int j=m-i,lim=n;j<s.size();j++,lim--) cntlcp[i][min(z[j],min(lim,m-i))]++;//,cout<<"cntlcp: "<<i<<" "<<min(z[j],lim)<<"\n";
		for(int j=n;j>=0;j--) cntlcp[i][j]+=cntlcp[i][j+1];
		for(int j=1;j<=m;j++) cntlcp[i][j]+=cntlcp[i][j-1];
	}
	
	for(int q=0;q<m;q++)
	{
		s="";
		for(int j=q;j>=0;j--) s+=T[j];
		getz();
		for(int j=q;j>=0;j--) lcs[j]=z[q-j];
		for(int mid=q;mid>=0;mid--)
		{
			int d=0;
			if(mid) d=lcs[mid-1];
			d=min(d,q-mid+1);
			int R=q-mid+1,L=R-d;
			L=max(L,1);
//			if(tp) R--;
			if(L>R) continue;
//			cout<<tp<<" "<<mid<<" "<<q<<" "<<L<<" "<<R<<"\n";
//			for(int l=0;l<=n;l++) cout<<cntlcp[mid][l]<<" ";
//			cout<<"\n";
			ans+=1LL*(cntlcp[mid][R]-(L?cntlcp[mid][L-1]:0LL));
//			cout<<ans<<"\n";
//			cout<<"... "<<cntlcp[mid][R]<<" "<<(L?cntlcp[mid][L-1]:0LL)<<" "<<ans<<"\n";
		} 
	}
}
void solve()
{
	string S,T;
	cin>>S>>T;
	work(S,T,0),work(T,S,1);
//	cout<<ans<<"\n";
	int n=S.size(),m=T.size();
	for(int i=0;i<S.size();i++)
	{
		s="";
		for(int j=i;j<S.size();j++) s+=S[j];
		s+=T;
		getz();
		for(int j=n-i;j<s.size();j++)
		{
			int d=min(n-i,z[j]);
			ans-=d;
		}
	}
	cout<<ans<<"\n";
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int _=1;
//	cin>>_;
	while(_--) solve();
	return 0;
}