#include <bits/stdc++.h>
using namespace std;
string s , t ,t2;
int r[20005];
void work(int n) {
    int mn = n ;
    int ans = 0;
    for(int i = n - 1;i >= 0;i--) {
        mn = min(mn , r[i]) ;
        ans += (n - mn) ;
    }
    cout << ans << '\n' ;
    return ;
}
int main() {
    ios::sync_with_stdio(false) ; cin.tie(0) ;
    cin >> s >> t2;
    for(int i = 0;i < t2.size();i++) {
        if(i == 0 || t2[i] != t2[i - 1]) t += t2[i] ;
    }
    if(t.size() == 1) {
        for(int i = 0;i < s.size();i++) {
            if(s[i] == t[0]) r[i] = i;
            else r[i] = 1e9;
        }
        work(s.size()) ;
        return 0;
    }
    for(int i = 0;i < s.size();i++) r[i] = 1e9;
    for(int i = 0;i < (int)s.size() - 1;i++) {
        int curt = 0 , curs = i;
        while(curt < t.size()) {
            if(s[curs] != t[curt] || s[curs + 1] != t[curt + 1]) {r[i] = 1e9 ; break ;}
            int cs = 0 , ct = 0;
            while(curs + 1 < s.size() && curt + 1 < t.size() && s[curs] == t[curt] && s[curs + 1] == t[curt + 1]) {
                curt += 2; ct += 2;
            }
            ///[i,curs + 1] -> [0 , curt - 1]
            if(curt == t.size()) {r[i] = curs + 1; break;}
            // printf("CT %d\n",curt) ;
            if(curt == t.size() - 1) {
                if(s[curs] == t[curt]) {r[i] = curs + 1; break ;}
            }
            while(curs + 3 < s.size() && s[curs] == s[curs + 2] && s[curs + 1] == s[curs + 3]) {
                curs += 2 ; cs += 2;
            }
            if(cs > ct) break ;
            curs++; curt--;
            // printf("%d %d %d\n",i,curs,curt) ;
            if(curs == s.size() - 1) {
                r[i] = 1e9 ; break ;
            }
        }
        curt = 0 ; curs = i - 1;
        while(curt < t.size()) {
            char scurs , scurs1 ;
            if(curs == i - 1) scurs = s[i + 1];
            else scurs = s[i] ;
            scurs1 = s[curs + 1] ;

            if(scurs != t[curt] || scurs1 != t[curt + 1]) {break ;}
            int cs = 0 , ct = 0;
            while(curs + 1 < s.size() && curt + 1 < t.size() && scurs == t[curt] && scurs1 == t[curt + 1]) {
                curt += 2; ct += 2;
            }
            ///[i,curs + 1] -> [0 , curt - 1]
            if(curt == t.size()) {r[i] = min(r[i] , curs + 1); break;}
            if(curt == t.size() - 1) {
                if(scurs == t[curt]) {r[i] = min(r[i] , curs + 1); break ;}
            }
            while(curs + 3 < s.size() && scurs == s[curs + 2] && scurs1 == s[curs + 3]) {
                curs += 2 ; cs += 2;
                scurs = s[curs];
                scurs1 = s[curs + 1];
            }
            if(cs > ct) break ;
            curs++; curt--;
            if(curs == s.size() - 1) {
                break ;
            }
        }
        r[i] = max(r[i] , i + 1) ;
        // printf("%d %d\n",i,r[i]) ;
    }
    work(s.size()) ;
    return 0;
}