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

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) int(x.size())
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
#define fi first
#define se second
#define pb push_back

const int N = 5050;
int counts[N][N], eq[N][N];
vi Z(const string & S) {
    vi z(sz(S));
    int l = -1, r = -1;
    rep(i, 1, sz(S)) {
        z[i] = i >= r ? 0 : min(r - i, z[i - l]);
        while (i + z[i] < sz(S) && S[i + z[i]] == S[z[i]])
            z[i]++;
        if (i + z[i] > r)
            l = i, r = i + z[i];
    }
    return z;
}

template<bool count_equal>
ll solve(string s, string t) {
    memset(counts, 0, sizeof counts);
    for(int k = 0; k < t.size(); k++) {
        string z = t.substr(k) + s;
        auto zfunc = Z(z);
        
        int pref = t.size() - k;
        for(int l = 0; l < s.size(); l++) {
            int r = l + min(pref, zfunc[pref + l]) - 1;
            counts[l][r]++;
        }
    }
    for(int l = 0; l < s.size(); l++) {
        for(int r = sz(s) - 1; r-- > l;) {
            counts[l][r] += counts[l][r + 1];
        }
    }
    for(int l = 0; l < sz(s); l++)
        for(int r = l + 1; r < sz(s); r++)
            counts[l][r] += counts[l][r - 1];
    
    memset(eq, 0, sizeof eq);
    for(int i = 0; i < s.size(); i++) {
        for(int j = 0; j < s.size(); j++) {
            if(s[i] == s[j]) {
                eq[i][j] = 1 + (i && j ? eq[i - 1][j - 1] : 0);
            }
        }
    }
    for(int l = 0; l < sz(s); l++)
        for(int r =0; r < l; r++)
            counts[l][r] =0;

    ll ans = 0;
    for(int l = 0; l < sz(s); l++) {
        for(int r = l; r < sz(s); r++) {
            int longest_suf = min(r - l, l ? eq[l - 1][r] : 0);
            // for(int i = !count_equal; i <= longest_suf; i++) {
            //     ans += counts[l][r - i];
            // }
            int maxR = r - !count_equal, minR = r - longest_suf;
            if(minR <= maxR) {
                ans += counts[l][maxR];
                ans -= minR > l ? counts[l][minR - 1] : 0;
            }
            // cout << l << " " << r << " " << ans << " eq " << maxR << " " << minR << endl;
        }
    }
    // cout << endl << endl;
    return ans;
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
    string s, t;
    cin >> s >> t;
    ll ans = 0;
    ans += solve<0>(t, s);
    // reverse(all(s)); reverse(all(t));//??
    ans += solve<1>(s, t);
    cout << ans << '\n';
}