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

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, b, a) for(int i = (b) - 1; i >= (a); 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 double db;

VI prefixFunction(const string& s)
{
	int n = SZ(s);
	VI p(n);
	p[0] = 0;
	FOR (i, 1, n)
	{
		int j = p[i - 1];
		while(j != 0 && s[i] != s[j]) 
			j = p[j - 1];

		if (s[i] == s[j]) j++;
		p[i] = j;
	}
	return p;
}


int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	cout << fixed << setprecision(15);
	string s, t;
	cin >> s >> t;
	
	
	string okt = "";
	FOR(i, 0, SZ(t))
	{
		if(SZ(okt) > 0 && okt.back() == t[i])
			continue;		
		okt += t[i];
	}
	t = okt;
	okt = "";
	FOR(i, 0, SZ(t))
	{
		if(SZ(okt) > 1 && i + 1 < SZ(t) && okt[SZ(okt) - 2] == t[i] && okt.back() == t[i + 1])
		{
			i++;
			continue;
		}
		okt += t[i];
	}
	if(SZ(okt) > 2 && okt[SZ(okt) - 3] == okt.back())
		okt.pop_back();
		
	if(SZ(okt) > 2 && okt[0] == okt[2])
		okt = okt.substr(1, SZ(okt) - 1);
	
	t = okt;
	if(SZ(t) == 2)
	{
		LL ans = 0;
		int l = -1;
		FOR(i, 0, SZ(s) - 1)
		{
			bool ok = (s[i] == t[0] && s[i + 1] == t[1]);
			ok |= (s[i] == t[1] && s[i + 1] == t[0]);
			
			if(!ok)
				continue;
			
			ans += (SZ(s) - i - 1) * (i - l);
			l = i;
		}
		cout << ans << endl;
		return 0;
	}
	auto p = prefixFunction(t + "#" + s);
	
	LL ans = 0;
	
	int l = SZ(t);
	FOR(i, SZ(t) + 1, SZ(p))
	{
		if(p[i] == SZ(t))
		{
			ans += (SZ(p) - i) * (LL) (i - SZ(t) + 1 - l);
			
			l = i - SZ(t) + 1;
		}
	}
	cout << ans << endl;
	
	
	
	
	

	
	return 0;
}