#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <typename T> std::vector<int> Z_Algorithm(const T& s) {
    int n = s.size();
    std::vector<int> z(n);
    z[0] = n;
    for (int i = 1, j = 0; i < n;) {
        while (i + j < n and s[j] == s[i + j]) j++;
        z[i] = j;
        if (j == 0) {
            i++;
            continue;
        }
        int k = 1;
        while (i + k < n and k + z[k] < j) z[i + k] = z[k], k++;
        i += k;
        j -= k;
    }
    return z;
}

template <typename T> std::vector<int> LCP(const T& s, const T& t) {
    T u(s);
    u.insert(u.begin(), t.begin(), t.end());
    std::vector<int> z = Z_Algorithm(u);
    for (int& i : z) i = std::min(i, (int)t.size());
    return std::vector<int>(z.begin() + t.size(), z.end());
}

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    string S, T;
    cin >> S >> T;

    ll ans = 0;
    string rS = S, rT = T;
    reverse(all(rS));
    reverse(all(rT));
    int n = S.size(), m = T.size();
    auto calc = [&]() -> ll {  // q - p >= v - u
        ll res = 0;
        for (int i = 1; i <= n; i++) {
            auto suf = S.substr(i, n - i);
            auto lcp1 = LCP(S.substr(0, i), suf);
            auto pre = rS.substr(n - i, i);
            auto lcp2 = LCP(rT, pre);
            vector<int> cnt(n + 2, 0);
            for (auto& x : lcp2) cnt[x]++;
            for (int j = n; j >= 0; j--) cnt[j] += cnt[j + 1];
            for (int j = n; j >= 0; j--) cnt[j] += cnt[j + 1];
            for (int j = 0; j < i; j++) {
                int half = i - j, x = lcp1[j];
                int high = half, low = max(1, half - x);
                res += cnt[low] - cnt[high + 1];
            }
        }
        return res;
    };
    for (int _ = 0; _ < 2; _++) {
        ans += calc();
        swap(S, T);
        swap(rS, rT);
        swap(n, m);
    }
    {
        // q - p = v - u
        for (int i = 0; i < n; i++) {
            auto s = S.substr(i, n - i);
            auto lcp = LCP(T, s);
            for (int j = 0; j < m; j++) ans -= lcp[j];
        }
    }
    cout << ans << '\n';
    return 0;
}