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

typedef long long ll;

const int N = 100010;

ll ans1, ans2;

namespace SAM {
	struct Node {
		int len, fa, ch[26];
	}sam[N];

	int sz[N];
	vector<int> adj[N];
	int cnt = 1, last = 1;
	void init() {
		cnt = 1, last = 1;
		for(int i = 0; i < N; i ++ ) {
			adj[i].clear();
			sam[i].len = sam[i].fa = 0;
			for(int j = 0; j < 26; j ++ ) {
				sam[i].ch[j] = 0;
			}
			sz[i] = 0;
		}
	}

	void insert(int ch) {
		int cur = ++ cnt, p;
		sam[cur].len = sam[last].len + 1;
		for(p = last; p && !sam[p].ch[ch]; p = sam[p].fa) {
			sam[p].ch[ch] = cur;
		}
		int q = sam[p].ch[ch];
		if(q == 0) {
			sam[cur].fa = 1;
		} else if(sam[p].len + 1 == sam[q].len) {
			sam[cur].fa = q;
		} else {
			int r = ++ cnt;
			sam[r] = sam[q];
			sam[r].len = sam[p].len + 1;
			for(; p && sam[p].ch[ch] == q; p = sam[p].fa) {
				sam[p].ch[ch] = r;
			}
			sam[q].fa = sam[cur].fa = r;
		}
		last = cur;
		sz[cur] = 1;
	}

	void dfs(int u, int fa) {
		for(auto v : adj[u]) {
			if(v == fa) continue;
			dfs(v, u);
			sz[u] += sz[v];
		}
	}

	void getsz() {
		for(int i = 2; i <= cnt; i ++ ) {
			adj[sam[i].fa].push_back(i);
		}
		dfs(1, 0);
	}

	int query(int &cur, int ch) {
		cur = sam[cur].ch[ch];
		return (cur == 1 ? 0 : sz[cur]);
	}
}

void solve(string &s, string &t) {
	int n = s.length();
	vector<vector<int>> dp(n + 1, vector<int> (n + 1, 0));
	for(int i = 0; i < n; i ++ ) {
		for(int j = 0; j < n; j ++ ) {
			if(s[i] == s[j]) {
				dp[i][j] = max(dp[i][j], (i - 1 >= 0 && j - 1 >= 0 ? dp[i - 1][j - 1] : 0) + 1);
			}
		}
	}

	SAM::init();
	int m = t.length();
	for(int i = 0; i < m; i ++ ) {
		SAM::insert(t[i] - 'a');
	}
	SAM::getsz();
	vector<vector<ll>> f(n + 1, vector<ll> (m + 2, 0));

	// cout << s << ' ' << t << '\n';
	for(int i = 0; i < n; i ++ ) {
		int cur = 1;
		for(int j = 1; j <= min(n - i, m); j ++ ) {
			f[i][j] = SAM::query(cur, s[i + j - 1] - 'a');
			ans2 += f[i][j];
			// cout << "ooo  " << i << ' ' << j << ' ' << f[i][j] << '\n';
		}
		for(int j = min(n - i, m) - 1; j >= 1; j -- ) {
			f[i][j] += f[i][j + 1];
		}
	}

	for(int i = 0; i + 2 < n; i ++ ) {
		for(int j = i + 2; j < n; j ++ ) {
			if(dp[i][j] >= 1) {
				// cout << "ooo  " << i << ' ' << j << ' ' << dp[i][j] << '\n';
				ans1 += f[i + 1][min(m + 1, max(1, j - i - dp[i][j]))] - f[i + 1][min(j - i, m + 1)];
			}
		}
	}
}

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

	string s, t;
	cin >> s >> t;
	solve(s, t);
	reverse(s.begin(), s.end());
	reverse(t.begin(), t.end());
	solve(t, s);
	// cout << ans1 << ' ' << ans2 << '\n';
	cout << ans1 + ans2 / 2 << '\n';

	return 0;
}