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

using ll = long long;
using ld = long double;

istream& operator>> (istream& in, vector <char>& a){
	string s;
	in >> s;
	a = vector <char>(begin(s), end(s));
	return in;
}

// z[i]: largest prefix(suffix if Reverse) starting(ending if Reverse) at i that is also a proper prefix(suffix if Reverse)
// O(n)
template<class Char_Type, bool Reverse = false>
vector<int> z_function(vector<Char_Type> s){
	if(Reverse) reverse(s.begin(), s.end());
	int n = (int)s.size();
	vector<int> z(n);
	for(auto i = 1, j = 0; i < n; ++ i){
		if(i < j + z[j]) z[i] = min(j + z[j] - i, z[i - j]);
		while(i + z[i] < n && s[z[i]] == s[i + z[i]]) ++ z[i];
		if(i + z[i] > j + z[j]) j = i;
	}
	if(Reverse) reverse(z.begin(), z.end());
	return z;
}

signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	if (fopen("KEK.inp", "r")){
		freopen("KEK.inp", "r", stdin);
		freopen("KEK.out", "w", stdout);
	}
	
	vector <char> s, t;
	cin >> s >> t;

	auto compress_t = [&](const vector <char>& t){
		vector <char> ans;
		for (auto c: t){
			if (ssize(ans) >= 1 and ans.back() == c){
				continue;
			}
			ans.emplace_back(c);
			if (ssize(ans) >= 4 and ans[ssize(ans) - 4] == ans[ssize(ans) - 2] and ans[ssize(ans) - 3] == ans[ssize(ans) - 1]){
				ans.pop_back();
				ans.pop_back();
			}
		}
		return ans;
	};

	t = compress_t(t);

	vector <pair <int, int>> a;

	auto find_t_in_s = [&](const vector <char>& t){
		vector <char> cur = t;
		cur.emplace_back('?');
		cur.insert(cur.end(), s.begin(), s.end());
		vector <int> z = z_function(cur);

		for (int i = ssize(t) + 1; i < ssize(cur); i++){
			if (z[i] == ssize(t)){
				a.emplace_back(i - ssize(t) - 1, i - 2);
			}
		}
	};

	if (ssize(t) == 1){
		find_t_in_s(t);
	}
	else if (ssize(t) == 2){
		find_t_in_s(t);
		find_t_in_s({t[1], t[0]});
	}
	else if (ssize(t) == 3 and t[0] == t[2]){
		find_t_in_s({t[0], t[1]});
		find_t_in_s({t[1], t[2]});
	}
	else{
		if (t[0] == t[2]){
			t.erase(t.begin());
		}
		if (t[ssize(t) - 3] == t[ssize(t) - 1]){
			t.pop_back();
		}
		find_t_in_s(t);
	}

	multiset <int> mts;
	for (auto &[l, r]: a){
		mts.emplace(r);
	}
	sort(begin(a), end(a), greater <>());

	ll ans = 0;
	for (int l = 0; l < ssize(s); l++){
		int r = (mts.empty() ? ssize(s) : *mts.begin());
		ans += ssize(s) - r;
		while (not a.empty() and a.back().first == l){
			mts.erase(mts.find(a.back().second));
			a.pop_back();
		}
	}

	cout << ans << "\n";
}