#ifndef LOCAL
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#endif

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

using ll=long long;
using uint=unsigned;

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(),x.end()
#define si(x) int(x.size())
#define a first
#define b second
template<class t>using vc=vector<t>;

template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b; return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(a>b){a=b; return true;}else return false;}

template<class t,class u>
ostream& operator<<(ostream&os,const pair<t,u>&p){
	return os<<"{"<<p.a<<","<<p.b<<"}";
}
template<class t>ostream& operator<<(ostream&os,const vector<t>&v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}

using P=pair<int,int>;
using vi=vc<int>;

void solve(){
	string s,t;
	cin>>s>>t;
	ll ans = 0;
	rep(_, 2){
		int n = si(s), m = si(t);
		vc<vi>ss(n+1,vi(n+1,0));
		vc<vi>st(n+1,vi(m+1,0));
		for(int i=n-1;i>=0;i--){
			for(int j=n-1;j>=0;j--){
				if(s[i] == s[j]) ss[i][j] = ss[i+1][j+1]+1;
			}
			for(int j=m-1;j>=0;j--){
				if(s[i] == t[j]) st[i][j] = st[i+1][j+1]+1;
			}
		}
		if(_ == 0){
			//same
			rep(i,n){
				rep(j,m){
					ans += st[i][j];
				}
			}
		}
		vc<vi>cnt(n+1,vi(n+1,0));
		rep(i,n){
			rep(j,m){
				if(st[i][j]){
					cnt[i][i] ++;
					cnt[i][i+st[i][j]] --;
				}
			}
			rng(j,i+1,n){
				cnt[i][j] += cnt[i][j-1];
			}
		}
		rep(j,n){
			for(int k=j-1;k>=0;k--){
				cnt[k][j] += cnt[k+1][j];
			}
		}
		rep(i,n) rng(j,i+1,n){
			int len = min(j-i-1, ss[i][j]);
			//[i+1][j-1]
			//...
			//[i+len][j-1]
			ans += cnt[i+1][j-1];
			if(i+len < j-1) ans -= cnt[i+len+1][j-1];
		}
		swap(s,t);
		reverse(all(s));
		reverse(all(t));
	}
	cout << ans << '\n';	
		
}
signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	solve();
}