#include <bits/stdc++.h>
using namespace std;
const int N = 2e4 + 10;;
string s, t;
int n, m, ans[N], f[2][N];
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> s >> t;
    // s.resize(2e4);
    // t.resize(2e4);
    // for (int i = 1; i <= 2e4; ++i) s[i] = 'a' + (i & 1);
    // for (int i = 1; i <= 2e4; ++i) t[i] = 'a' + (i & 1);
    n = s.size(); m = t.size();
    s = ' ' + s; t = ' ' + t;
    {
        int tp = 0;
        for (int i = 1; i <= m; ++i) if (t[i] != t[i - 1]) t[++tp] = t[i];
        m = tp;
        t.resize(tp + 1);
    }
    ans[n + 1] = n + 1;
    if (m == 1) {
        for (int i = n; i; --i) {
            ans[i] = (s[i] == t[1] ? i : n + 1);
            ans[i] = min(ans[i], ans[i + 1]);
        }
    } else {
        for (int i = 1; i <= m + 1; ++i) f[n & 1][i] = n + 1;
        f[n & 1][m] = (s[n] == t[m] ? n : n + 1);
        ans[n] = n + 1; 
        for (int i = n - 1; i; --i) {
            f[i & 1][m + 1] = i;
            f[i & 1][m] = (s[i] == t[m] ? i : n + 1);
            if (s[i + 1] == t[m]) f[i & 1][m] = i + 1;
            for (int j = m - 1; j; --j) {
                if (s[i] != t[j]) f[i & 1][j] = n + 1;
                else {
                    f[i & 1][j] = f[(i + 1) & 1][j + 1];
                    if (s[i + 1] == t[j + 1]) f[i & 1][j] = min(f[i & 1][j], max(i + 1, f[i & 1][j + 2]));
                }
            }
            ans[i] = min(f[i & 1][1], ans[i + 1]);
            if (s[i + 1] == t[1]) ans[i] = min(ans[i], max(i + 1, f[i & 1][2]));
        }
    }
    int rst = 0;
    for (int i = 1; i <= n; ++i) rst += n - ans[i] + 1;
    cout << rst << endl;
    return 0;
}