//#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>

using namespace std;

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

#define X first
#define Y second

const ll mod = 1000000007;
//const ll mod = 998244353;



void solve()
{
    string s, t;
    cin >> s >> t;
    {
        string t2;
        for (int i=0;i<t.size();i++)
        {
            if (t2.size()>0 and t2.back()==t[i]) continue;
            t2 += t[i];
        }
        t = t2;
    }
    while (t.size()>2 and t.back()==t[t.size()-3]) t.pop_back();
    int n = s.length(), m = t.length();
    vector<int> mn(n+1,n+1);
    for (int i=0;i<n;i++)
    {
        int j = 0;
        if (s[i]!=t[0])
        {
            if (i+1==n or s[i+1]!=t[0] or t.length()==1) continue;
            j = 1;
        }
        for (int w=i;w<n;w++)
        {
            while (j+1<m and s[w]!=t[j] and j>1 and t[j]==t[j-2] and t[j+1]==t[j-1])
            {
                j += 2;
            }
            if (s[w]!=t[j]) break;
            j++;
            if (j==m)
            {
                mn[i] = w+1;
                break;
            }
        }
        if (s[i]!=t[0]) mn[i] = max(mn[i],i+2);
    }
    for (ll i=n-1;i>=0;i--) mn[i] = min(mn[i+1],mn[i]);
    ll A = 0;
    for (ll i=0;i<n;i++) A += n+1-mn[i];
    cout << A << "\n";
}


int main()
{
    ios_base::sync_with_stdio(false);
    ll T;
    T = 1;
    //cin >> T;
    while (T--) solve();
}