#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#define FOR() ll le=e[u].size();for(ll i=0;i<le;i++)
#define QWQ cout<<"QwQ\n";
#define ll long long
#include <vector>
#include <queue>
#include <map>

using namespace std;
const ll N=201010;
const ll qwq=303030;

ll n,m;
char s[5050],t[5050],z[5050];
int f[5050][5050],g[5050][5050];
ll a[5050],b[5050];
ll ans;

inline ll read() {
    ll sum = 0, ff = 1; char c = getchar();
    while(c<'0' || c>'9') { if(c=='-') ff = -1; c = getchar(); }
    while(c>='0'&&c<='9') { sum = sum * 10 + c - '0'; c = getchar(); }
    return sum * ff;
}

void solve(ll cl) {
    memset(f,0,sizeof(f));
    memset(g,0,sizeof(g));
    for(ll i=n;i>=1;i--) {
        for(ll j=n;j>=1;j--) {
            if(s[i]==s[j]) f[i][j] = f[i+1][j+1] + 1;
        }
    }
    for(ll i=1;i<=n;i++) {
        for(ll j=1;j<=m;j++) {
            if(s[i]==t[j]) g[i][j] = g[i-1][j-1] + 1;
        }
    }
    for(ll i=1;i<=n;i++) {
        memset(a,0,sizeof(a));
        memset(b,0,sizeof(b));
        for(ll j=1;j<=m;j++) {
            a[ g[i][j] ]++;
            b[ g[i][j] ]+=g[i][j];
        }
        for(ll j=m;j>=1;j--) a[j] += a[j+1], b[j] += b[j+1];
        for(ll j=1;j<=i;j++) {
            ll wo = f[i+1][j];
            ll zong = (i-j+1);
            ll L = max(1ll,zong-wo), R = (cl==1) ? zong : zong-1;
            if(L>R) continue;
            ans += a[R+1] * (R-L+1);
            ans += (b[L] - b[R+1]) - (a[L] - a[R+1]) * (L-1);
        }
    }
}

int main() {
    scanf("%s%s",s+1,t+1); n = strlen(s+1); m = strlen(t+1);
    solve(1);
    reverse(s+1,s+n+1);
    reverse(t+1,t+m+1);
    for(ll i=1;i<=n;i++) z[i] = s[i];
    for(ll i=1;i<=m;i++) s[i] = t[i];
    for(ll i=1;i<=n;i++) t[i] = z[i];
    swap(m,n);
    solve(0);
    cout<<ans;
    return 0;
}