#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef double db;

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

const int N = 5047;

LL cnt[N][N];
LL pref[N][N];


int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	cout << fixed << setprecision(15);

	string s, t;
	cin >> s >> t;
	

	LL ans = 0;
	FOR(it, 0, 2)
	{
		FOR(i, 0, N)
		{
			fill(cnt[i], cnt[i] + N, 0);
			fill(pref[i], pref[i] + N, 0);
		}
		FOR(L, 0, SZ(s))
		{
			VI ze = zFunction(s.substr(L, SZ(s) - L) + "#" + t);
			FOR(i, 0, SZ(t))
			{
				int len = ze[i + (SZ(s) - L + 1)];
				cnt[L][L + len]++;
			}
			RFOR(i, N, 1)
				cnt[L][i - 1] += cnt[L][i];
		}
		FOR(R, 1, SZ(s) + 1)
		{
			FOR(L, 0, SZ(s))
			{
				pref[L + 1][R] = pref[L][R] + cnt[L][R];				
			}
		}
		
		
		FOR(L, 0, SZ(s))
		{
			VI ze = zFunction(s.substr(L, SZ(s) - L));
			FOR(L1, L + 1, SZ(s))
			{
				int mxY = min(ze[L1 - L], L1 - L - 1);
				
				
				LL cur = pref[L + mxY + 1][L1] - pref[L + 1][L1];
				
				ans += cur;
			}
		}
		if(it == 1)
		{
			FOR(L, 0, SZ(s))
				FOR(R, L + 1, SZ(s) + 1)
					ans += cnt[L][R];
		}
		swap(s, t);
	}
	cout << ans << "\n";
	return 0;
}