#include <bits/stdc++.h>
using namespace std;

#define F first
#define S second 
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define make_unique(x) sort(all(x)), x.erase(unique(all(x)), x.end())


const int N = 1e4 + 200;

string s, t;
int p[N], r[N], pos[N], pr[N];
int dp[N / 2][N / 2], pd[N / 2][N / 2];
long long ans = 0;

int main() {
    ios_base::sync_with_stdio(0), cin.tie(0);

    cin >> s >> t;
    int a = sz(s), b = sz(t);

    string S = s + "$" + t;
    int n = sz(S);
    for (int i = 0; i < n; ++i) {
        p[i] = (S[i] == '$' ? 0 : S[i] - 'a' + 1);
    }
    for (int k = 1; k <= n; k *= 2) {
        for (int i = 0; i < n; ++i) {
            r[i] = p[i] * n + (i + k < n ? p[i + k] : 0);
        }
        sort(r, r + n);
        for (int i = 0; i < n; ++i) {
            auto val = p[i] * n + (i + k < n ? p[i + k] : 0);
            p[i] = lower_bound(r, r + n, val) - r;
            pos[p[i]] = i;
        }
    }
    for (int i = 1; i < n; ++i) {
        pr[i] = pr[i - 1] + (pos[i] < a);
    }
    for (int i = a - 1; i >= 0; --i) {
        for (int j = a - 1; j >= 0; --j) {
            if (s[i] == s[j]) {
                dp[i][j] = (i + 1 < a && j + 1 < a ? dp[i + 1][j + 1] : 0) + 1;
                pd[i][j]++;
                pd[i + dp[i][j]][j]--;
            }
        }
    }
    for (int j = 0; j < a; ++j) {
        for (int i = 1; i < a; ++i)
            pd[i][j] += pd[i - 1][j];
    }
    for (int i = 1; i < n; ++i) {
        if (pos[i] > a) continue;
        int l = i, r = i;
        while (l - 1 >= 0 && S[pos[l - 1]] == S[pos[i]]) l--;
        while (r + 1 < n && S[pos[r + 1]] == S[pos[i]]) r++;
        for (int j = pos[i]; j < a; ++j) {
            int k = (r - l + 1) - (pr[r] - pr[l - 1]);
            ans += k * 1ll * ((pos[i] && j + 1 < a ? pd[pos[i] - 1][j + 1] : 0) + 1);
            while (S[pos[l] + j - pos[i] + 1] != S[j + 1]) l++;
            while (S[pos[r] + j - pos[i] + 1] != S[j + 1]) r--;
        }
    }
    for (int i = b - 1; i >= 0; --i)
        for (int j = b - 1; j >= 0; --j)
            dp[i][j] = pd[i][j] = 0;
    for (int i = b - 1; i >= 0; --i) {
        for (int j = b - 1; j >= 0; --j) {
            if (t[i] == t[j]) {
                dp[i][j] = (i + 1 < b && j + 1 < b ? dp[i + 1][j + 1] : 0) + 1;
                pd[i][j]++;
                pd[i + dp[i][j]][j]--;
            }
        }
    }
    for (int j = 0; j < b; ++j) {
        for (int i = 1; i < b; ++i)
            pd[i][j] += pd[i - 1][j];
    }
    for (int i = 1; i < n; ++i) {
        if (pos[i] < a) continue;
        int l = i, r = i;
        while (l - 1 >= 0 && S[pos[l - 1]] == S[pos[i]]) l--;
        while (r + 1 < n && S[pos[r + 1]] == S[pos[i]]) r++;
        for (int j = pos[i]; j < n; ++j) {
            int k = (pr[r] - pr[l - 1]);
            ans += k * 1ll * (pos[i] - 1 > a && j + 1 < n ? pd[pos[i] - a - 2][j - a] : 0);
            while (S[pos[l] + j - pos[i] + 1] != S[j + 1]) l++;
            while (S[pos[r] + j - pos[i] + 1] != S[j + 1]) r--;
        }
    }
    cout << ans << '\n';

}