#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int go[N][26],par[N],len[N],top,last;
int New(int L){len[++top]=L;return top;}
void extend(int w){
	int p=last,np=New(len[p]+1);
	while (p&&!go[p][w]) go[p][w]=np,p=par[p];
	if (!p) par[np]=1;
	else{
		int q=go[p][w];
		if (len[q]==len[p]+1) par[np]=q;
		else{
			int nq=New(len[p]+1);
			memcpy(go[nq],go[q],sizeof go[q]);
			par[nq]=par[q];
			par[np]=par[q]=nq;
			while (p&&go[p][w]==q) go[p][w]=nq,p=par[p];
		}
	}
	last=np;
}
char s[N],t[N];
int n,m,cnt1[N],cnt2[N],cnt[N],a[N];
int main()
{
	freopen("find_2016.in","r",stdin);
	freopen("find_2016.out","w",stdout);
	scanf("%s%s",s+1,t+1);
	n=strlen(s+1);
	m=strlen(t+1);
	last=New(0);
	for (int i=1;i<=n;i++) extend(s[i]-'a');
	last=1;
	for (int i=1;i<=m;i++) extend(t[i]-'a');
	for (int i=1,p=1;i<=n;i++){
		int w=s[i]-'a';
		p=go[p][w];
		cnt1[p]++;
	}
	for (int i=1,p=1;i<=m;i++){
		int w=t[i]-'a';
		p=go[p][w];
		cnt2[p]++;
	}
	for (int i=1;i<=top;i++) cnt[len[i]]++;
	for (int i=1;i<=top;i++) cnt[i]+=cnt[i-1];
	for (int i=1;i<=top;i++) a[cnt[len[i]]--]=i;
	long long ans=0;
	for (int i=top;i;i--){
		int v=a[i];
		cnt1[par[v]]+=cnt1[v];
		cnt2[par[v]]+=cnt2[v];
		ans+=1ll*cnt1[v]*cnt2[v]*(len[v]-len[par[v]]);
	}
	printf("%lld\n",ans);
	return 0;
}