#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#define dbg(x) cerr<<"In the line "<<__LINE__<<": the "<<#x<<" = "<<x<<'\n'
#define dpi(x,y) cerr<<"In the line "<<__LINE__<<": the "<<#x<<" = "<<x<<" ; the "<<#y<<" = "<<y<<'\n'
#define DE(fmt,...) fprintf(stderr, "Line %d : " fmt "\n",__LINE__,##__VA_ARGS__)
#define pb emplace_back
using namespace std;
typedef vector<int>vi;
typedef long long ll;
template<typename T>
T &read(T &r){
	r=0;bool w=0;
	char ch=getchar();
	while(ch<'0'||ch>'9')w=ch=='-'?1:0,ch=getchar();
	while(ch>='0'&&ch<='9')r=r*10+ch-'0',ch=getchar();
	return r=w?-r:r;
}
const int N=5010;
struct suffixArray{
	int n;
	int sa[N],rk[N],id[N],ork[N],bac[N];
	int ht[N],mn[N][N];
	int lcp(int x,int y){
		if(x==y)return n-x+1;
		x=rk[x];y=rk[y];
		if(x>y)swap(x,y);
		++x;
		return mn[x][y];
	}
	void getSA(char *s){
		n=strlen(s+1);
		#define mem(x) memset(x,0,sizeof(x))
		mem(sa);mem(rk);mem(id);mem(ork);mem(bac);mem(ht);mem(mn);
		int m=1<<7,p=0;
		for(int i=1;i<=n;i++)bac[rk[i]=s[i]]++;
		for(int i=1;i<=m;i++)bac[i]+=bac[i-1];
		for(int i=n;i>=1;i--)sa[bac[rk[i]]--]=i;
		for(int w=1;;m=p,p=0,w<<=1){
			for(int i=n-w+1;i<=n;i++)id[++p]=i;
			for(int i=1;i<=n;i++)if(sa[i]-w>=1)id[++p]=sa[i]-w;
			memset(bac,0,sizeof(int)*(m+1));
			memcpy(ork,rk,sizeof(int)*(n+1));
			for(int i=1;i<=n;i++)bac[rk[i]]++;
			for(int i=1;i<=m;i++)bac[i]+=bac[i-1];
			for(int i=n;i>=1;i--)sa[bac[rk[id[i]]]--]=id[i];
			p=0;
			auto cmp=[&](int x,int y){
				return ork[x]!=ork[y]||ork[x+w]!=ork[y+w];
			};
			for(int i=1;i<=n;i++){
				if(cmp(sa[i],sa[i-1]))++p;
				rk[sa[i]]=p;
			}
			if(p==n)break;
		}
		for(int i=1;i<=n;i++){
			int k=max(0,ht[rk[i-1]]-1);
			int p=sa[rk[i]-1];
			while(p+k<=n&&i+k<=n&&s[p+k]==s[i+k])++k;
			ht[rk[i]]=k;
		}
		for(int i=2;i<=n;i++){
			mn[i][i]=ht[i];
			for(int j=i+1;j<=n;j++)mn[i][j]=min(mn[i][j-1],ht[j]);
		}
	}
}SA;
struct suffixAM{
	struct Node{
		int ch[26],fa,len;
	}a[N<<2];
	int siz[N<<2],tot=1,las=1;
	vi eg[N<<2];
	void init(){
		memset(a,0,sizeof(a));
		memset(siz,0,sizeof(siz));
		for(int i=1;i<=tot;i++)vi().swap(eg[i]);
		tot=1;las=1;
	}
	void ins(int x){
		int cur=++tot;
		a[cur].len=a[las].len+1;siz[cur]=1;
		int p=las;las=cur;
		for(;p&&!a[p].ch[x];p=a[p].fa)a[p].ch[x]=cur;
		if(!p)a[cur].fa=1;
		else{
			int q=a[p].ch[x];
			if(a[q].len==a[p].len+1)a[cur].fa=q;
			else{
				int c=++tot;
				a[c]=a[q];a[c].len=a[p].len+1;
				a[q].fa=a[cur].fa=c;
				for(;p&&a[p].ch[x]==q;p=a[p].fa)a[p].ch[x]=c;
			}
		}
	}
	void dfs(int x){
		for(auto v:eg[x]){
			dfs(v);
			siz[x]+=siz[v];
		}
	}
}SAM;
int n,m;
char s[N],t[N];
int w[N][N],c[N][N];
ll ans;
void solve(int op){
	memset(c,0,sizeof(c));
	memset(w,0,sizeof(w));
	SA.getSA(s);
	SAM.init();
	for(int i=1;i<=m;i++)SAM.ins(t[i]-'a');
	for(int i=2;i<=SAM.tot;i++)SAM.eg[SAM.a[i].fa].pb(i);
	SAM.dfs(1);
	for(int i=1;i<=n;i++){
		int x=1;
		for(int j=i;j<=n;j++){
			x=SAM.a[x].ch[s[j]-'a'];
			w[i][j]=SAM.siz[x];
			if(op)
				ans+=w[i][j];
		}
	}
	for(int i=1;i<=n;i++)
		for(int j=i+2;j<=n;j++){
			int k=SA.lcp(i,j);
			k=min(k,j-i-1);
			c[i][j-1]--;
			c[i+k][j-1]++;
		}
	for(int j=1;j<=n;j++){
		ll s=0;
		for(int i=j;i>=1;i--){
			s+=c[i][j];
			ans+=s*w[i][j];
		}
	}
}
signed main(){
	scanf("%s",s+1);
	scanf("%s",t+1);
	n=strlen(s+1);
	m=strlen(t+1);
	solve(1);
	swap(n,m);
	swap(s,t);
	solve(0);
	cout<<ans<<'\n';
	return 0;
}