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

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

const int inf = 1e5;

using pint = pair<int, int>;
#define x first
#define y second

int N, M;
char s[20004], t[20004];

int match(int st) {
  int mn, mx;

  if (s[st] == t[0])
    mn = mx = st;
  else if (st + 1 < N and s[st + 1] == t[0])
    mn = mx = st + 1;
  else
    return -1;

  int mnp, mxp;
  for (int i = 0; i < M; i++) {
    char x = t[i];

    mnp = inf, mxp = -inf;

    if (x == s[mx] or (st < mx and x == s[mx - 1])) {
      mnp = mx;
      mxp = mx;
    }
    if (mx + 1 < N and x == s[mx + 1]) {
      mnp = min(mnp, mx + 1);
      mxp = mx + 1;
    }

    if (mn < mx) {
      if (mn + 1 < N and x == s[mn + 1]) mnp = mn + 1;
      if (x == s[mn] or (st < mn and x == s[mn - 1])) mnp = mn;
    }

    if (mnp == inf) return -1;

    mn = mnp, mx = mxp;
  }

  return mn;
}

int main() {
  scanf("%s%s", s, t);

  N = strlen(s);
  M = strlen(t);

  vector<pint> v;

  for (int i = 0; i < N; i++) {
    int now = match(i);

    if (now != -1) v.push_back({i, now});
  }

  for (int i = v.size() - 2; i >= 0; i--) v[i].y = min(v[i].y, v[i + 1].y);

  int ans = 0;
  for (int i = 0; i < N; i++) {
    auto it = lower_bound(v.begin(), v.end(), pint(i, 0));

    if (it != v.end()) ans += N - it->y;
  }

  printf("%d\n", ans);
}