#include <bits/stdc++.h>

using namespace std;

#define iter(v) v.begin(), v.end()
#define SZ(v) int(v.size())
#define pb emplace_back
#define ff first
#define ss second

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

#ifdef zisk
void debug(){cerr << "\n";}
template<class T, class ... U>
void debug(T a, U ... b){cerr << a << " ", debug(b...);}
template<class T> void pary(T l, T r){
	while (l != r) cerr << *l << " ", l++;
	cerr << "\n";
}
#else
#define debug(...) void()
#define pary(...) void()
#endif

template<class A, class B>
ostream &operator<<(ostream& o, pair<A, B> p) {
	return o << '(' << p.ff << ',' << p.ss << ')';
}

vector<int> zval(const string &s) {
	int n = SZ(s);
	vector<int> z(n);
	for(int i = 1, l = 0, r = 0; i < n; i++) {
		if (i <= r) z[i] = min(r - i + 1, z[i - l]);
		while (i + z[i] < n && s[z[i]] == s[i + z[i]])
			z[i]++;
		if (i + z[i] - 1 > r)
			l = i, r = i + z[i] - 1;
	}
	return z;
}

ll solve(string &S, string &T) {
	int n = SZ(S);
	ll ans = 0;
	//debug("solve", S, T);

	vector cnt(n, vector<ll>(n + 1, 0));
	for (int i = 0; i < n; i++) {
		string tmp = T + '$' + S.substr(0, i + 1);
		reverse(iter(tmp));
		vector<int> z = zval(tmp);
		//debug("test", tmp);
		//pary(iter(z));

		for (int j = i + 2; j < SZ(tmp); j++) {
			//debug("test", i, z[j], cnt[i][z[j]]);
			cnt[i][z[j]]++;
		}
		for (int j = n - 1; j >= 0; j--)
			cnt[i][j] += cnt[i][j + 1];
		for (int j = 1; j <= n; j++)
			cnt[i][j] += cnt[i][j - 1];
	}

	for (int i = 0; i < n; i++) {
		string tmp = S.substr(i);
		vector<int> z = zval(tmp);
		for (int len = 2; len < SZ(tmp); len++) {
			int j = i + len;
			int t = min(z[len], len - 1);
			if (t == 0) continue;
			ans += cnt[j - 1][len - 1] - cnt[j - 1][len - t - 1];
			//debug("test", i, j, S.substr(i, len), cnt[j - 1][len - 1] - cnt[j - 1][len - t - 1]);
		}
	}

	return ans;

}

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

	string S, T;
	cin >> S >> T;
	
	ll ans = 0;

	for (int i = 0; i < SZ(S); i++) {
		string tmp = S.substr(i) + '$' + T;
		vector<int> z = zval(tmp);
		for (int j = SZ(S) - i + 1; j < SZ(tmp); j++) {
			ans += z[j];
		}
	}
	//debug("test", ans);

	ans += solve(S, T);
	//debug("test", ans);
	reverse(iter(S));
	reverse(iter(T));
	ans += solve(T, S);
	//debug("test", ans);
	cout << ans << "\n";

}