#include <bits/stdc++.h>
#ifdef LOCAL_DEBUG
#include "debug.h"
#else
#define dbg(...) (void)0
#endif
using u32 = unsigned int;
using i64 = long long;

namespace skadi {

const int MAXN = 2e4;
int pi[MAXN], cnt[MAXN], z[MAXN];

inline void prefix_funcion(std::string_view sv) {
    int n = sv.size();
    pi[0] = cnt[0] = 0;
    for (int i = 1, j = 0; i < n; ++i) {
        pi[i] = cnt[i] = 0;
        while (j && sv[i] != sv[j]) j = pi[j - 1];
        if (sv[i] == sv[j]) ++j;
        if (j) cnt[i] = cnt[j - 1] + 1;
        pi[i] = j;
    }
}

inline void z_function(std::string_view sv) {
    int n = sv.size();
    z[0] = 0;
    for (int i = 1, l = 0, r = 0; i < n; i++) {
        z[i] = std::min(z[i - l], std::max(r - i, 0));
        while (i + z[i] < n && sv[z[i]] == sv[i + z[i]]) z[i]++;
        if (i + z[i] >= r) l = i, r = i + z[i];
    }
    z[0] = n;
}

void solve() {
    static std::string s, t;
    std::cin >> s >> t;
    auto work = [](std::string const& s, std::string const& t) -> i64 {
        int n = s.size(), m = t.size();
        std::vector<std::vector<i64>> f(n + 1, std::vector<i64>(n + 1));
        std::string tmp = s + '#';
        for (int i = 1; i < n; i++) {
            std::rotate(tmp.begin(), tmp.begin() + 1, tmp.end());
            prefix_funcion(tmp);
            int offset = n + 1 - i;
            for (int j = 0; j < i - 1; j++) {
                f[j + 1][i] += cnt[j + offset];
            }
        }
        for (int i = 0; i < n; i++) {
            for (int j = 1; j <= n; j++) {
                f[i][j] += f[i][j - 1];
            }
        }
        i64 ans = 0;
        tmp = t + '#' + s;
        for (int i = 0; i < m; i++) {
            z_function(std::string_view(tmp).substr(i));
            int offset = m + 1 - i;
            for (int j = 0; j < n; j++) {
                ans += f[j][j + z[j + offset]] - f[j][j];
            }
        }
        return ans;
    };
    i64 ans = work(s, t) + work(t, s);
    int n = s.size(), m = t.size();
    std::string tmp = t + '#' + s;
    for (int i = 0; i < m; i++) {
        z_function(std::string_view(tmp).substr(i));
        int offset = m + 1 - i;
        for (int j = 0; j < n; j++) {
            ans += z[j + offset];
        }
    }
    std::cout << ans << '\n';
}

} // namespace skadi

int main() {
#ifndef LOCAL_DEBUG
    std::cin.tie(nullptr)->sync_with_stdio(false);
#endif
    int t = 1;
    // std::cin >> t;
    while (t--) {
        skadi::solve();
    }
    return 0;
}