#include<bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 5e3 + 5;
const int mod = 1e12 + 7;
const ll oo = 1e18;
string s, t;

int n, m;
int f[maxN][maxN];
int sum[maxN][maxN];
int dp[maxN][maxN];
int cnt[maxN][maxN];
void ReadInput()
{
    cin >> s >> t;
    s = ' ' + s;
    t = ' ' + t;
    n = s.size() - 1;
    m = t.size() - 1;

}
void Solve()
{
    for(int i=n; i>=1; i--)
        for(int j=m; j>=1; j--)
        {
            dp[i][j] = (s[i] == t[j] ? dp[i + 1][j + 1] + 1 : 0);
        }

    ll res = 0;
    //cout << n << " " << m;return;
    for(int i=n; i>=1; i--)
        for(int j=n; j>=1; j--)
            f[i][j] = (s[i] == s[j] ? f[i + 1][j + 1] + 1 : 0);
    // const s(i..j)
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=m; j++)
            cnt[i][dp[i][j]]++;
        for(int j=n; j>=1; j--)
            cnt[i][j] += cnt[i][j + 1];
    }
    //cout << cnt[1][0];return;
  //  cout << cnt[1][2];return;
    for(int j=1; j<=n; j++)
        for(int i=1; i<=n; i++)
        {
            sum[j][i] = sum[j][i - 1] + (j >= i ? cnt[i][j - i + 1] : 0);
        }
    //cout << sum[2][3];return;
    for(int i=1; i<=n; i++)
    {
        for(int j=i; j<=n; j++)
        {
            int len = min(j - i + 1, f[i][j + 1]);

            res += sum[j][i + len] - sum[j][i - 1];
            if(i == 1 && j == 2)
            {
                //cout << sum[j][i + len];return;
            }
           // cout << i << " " << j << " " << sum[j][i + len] - sum[j][i - 1] << '\n';
        }
    }
    // const t(i..j)
    memset(f, 0, sizeof f);
    memset(cnt, 0, sizeof cnt);
    for(int i=m; i>=1; i--)
        for(int j=m; j>=1; j--)
            f[i][j] = (t[i] == t[j] ? f[i + 1][j + 1] + 1 : 0);
    for(int i=1; i<=m; i++)
    {
        for(int j=1; j<=n; j++)
            cnt[i][dp[j][i]]++;
        for(int j=m; j>=1; j--)
            cnt[i][j] += cnt[i][j + 1];
    }
    for(int j=1; j<=m; j++)
        for(int i=1; i<=m; i++)
        {
            sum[j][i] = sum[j][i - 1] + (j >= i ? cnt[i][j - i + 1] : 0);
        }
    for(int i=1; i<=m; i++)
    {
        for(int j=i; j<=m; j++)
        {
            int len = min(j - i + 1, f[i][j + 1]);

            res += sum[j][i + len] - sum[j][i ];
        }
    }
    cout << res;
}
#define taskname "D"
int32_t main()
{
    if (fopen(taskname ".inp", "r"))
    {
        freopen(taskname ".inp", "r", stdin);
        // freopen(taskname ".out", "w", stdout);
    }
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    //cin >> T;
    for(int itest=1; itest<=T; itest++)
    {
        ReadInput();
        Solve();
    }
}