#include<bits/stdc++.h>

 using namespace std;

 typedef long long ll;

 const int N=;

 ll ans;

 int p,np,cnt,fa[N],son[N][],tt[N],sz1[N],sz2[N],l[N],sl,tl,Cnt[N];

 char a[N],b[N];

 void sam(int c)

 {

     p=np; np=++cnt;l[np]=l[p]+;

     if (son[p][c]&&l[son[p][c]]==l[p]+) {cnt--,np=son[p][c];return;}

     for (;p&&!son[p][c];p=fa[p]) son[p][c]=np;

     if (!p) fa[np]=;

     else {

         int q=son[p][c];

         if (l[q]==l[p]+) fa[np]=q;

         else {

             int nq=++cnt;l[nq]=l[p]+;

             memcpy(son[nq],son[q],sizeof(son[q]));

             fa[nq]=fa[q];fa[q]=fa[np]=nq;

             for (;p&&son[p][c]==q;p=fa[p]) son[p][c]=nq;

         }

     }

 }

 int main()

 {

     scanf("%s%s",a+,b+);

     sl=strlen(a+);tl=strlen(b+);

     cnt=np=;

     for (int i=;i<=sl;i++) sam(a[i]-'a'),sz1[np]++;

     np=;

     for (int i=;i<=tl;i++) sam(b[i]-'a'),sz2[np]++;

     for (int i=;i<=cnt;i++) Cnt[l[i]]++;

     for (int i=;i<=cnt;i++) Cnt[i]+=Cnt[i-];

     for (int i=;i<=cnt;i++) tt[Cnt[l[i]]--]=i;

     for (int i=cnt;i>=;i--)

     {

         int x=tt[i];

         sz1[fa[x]]+=sz1[x];sz2[fa[x]]+=sz2[x];

     }

     for (int i=;i<=cnt;i++) ans+=(ll)sz1[i]*sz2[i]*(l[i]-l[fa[i]]);

     printf("%lld\n",ans);

     return ;

 }