#include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
typedef long long ull;
typedef unsigned long long uull;
typedef pair<int, int> PII;
mt19937 rnd1(random_device{}());
mt19937_64 rnd2(random_device{}());
uniform_int_distribution<int> dist1(0,2e18);    //定义dist1为0——100的随机整数
uniform_real_distribution<double> dist2(-10,10);    //定义dist2为-10——10的随机浮点数
//#define mp make_pair
//fflush(stdout);
inline void print(__int128 x){//输出模板 
    if(x<0){
        putchar('-');
        x=-x;
    }
    if(x>9) print(x/10);
    putchar(x%10+'0');
}
inline int read()
{
    int X = 0;
    bool flag = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9')
    {
        if (ch == '-')
            flag = 0;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9')
    {
        X = (X << 1) + (X << 3) + ch - '0';
        ch = getchar();
    }
    if (flag)
        return X;
    return ~(X - 1);
}
const ull mod = 1e9+7,INF = 2e18;
ull qpow(ull a, ull b)
{
    ull res = 1;
    a %= mod;
    assert(b >= 0);
    for (; b; b >>= 1)
    {
        if (b & 1)
            res = res * a % mod;
        a = a * a % mod;
    }
    return res;
}
inline int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
inline int lcm(int a, int b) { return a / gcd(a, b) * b; }
const int N = 200010,M = 400010;

string S,T;
int lcp[5010][5010],cnt[5010],pre[5010],all[5010][5010];
int ans;

void work(int flag)
{
    for(int j=S.size()-1;j>=0;j--)
        for(int i=S.size()-1;i>=0;i--)
            if(S[i]==S[j]) lcp[i][j] = lcp[i+1][j+1]+1;
    for(int j=0;j<=S.size();j++)
    {
        for(int i=0;i<=S.size();i++) pre[i] = 0;
        for(int i=0;i<j-1;i++)
            if(lcp[i][j])
            {
                pre[i+1] ++;
                pre[i+lcp[i][j]+1]--;
            }
        for(int i=0;i<j;i++) if(i) pre[i] += pre[i-1];
        for(int i=j-1;i>=0;i--) all[i][j-1] += pre[i]+flag;
    }
    memset(lcp,0,sizeof(lcp));
    for(int i=S.size()-1;i>=0;i--)
        for(int j=T.size()-1;j>=0;j--)
            if(S[i]==T[j]) lcp[i][j] = lcp[i+1][j+1]+1;
    for(int i=0;i<S.size();i++)
    {
        for(int j=0;j<T.size();j++)
            cnt[lcp[i][j]] ++;
        for(int j=S.size();j>=0;j--)
            cnt[j] += cnt[j+1];
        for(int j=i;j<S.size();j++)
            ans += cnt[j-i+1]*all[i][j],all[i][j] = 0;
        for(int j=0;j<=S.size();j++) cnt[j] = 0;
    }   
    memset(lcp,0,sizeof(lcp));
}

void solve()
{
    ans = 0;
    cin>>S>>T;
    work(1);
    swap(S,T);
    work(0);
    cout<<ans<<endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    //cin>>t;
    while (t--)
        solve();
    return 0;
}