#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 101010;

int pos[26][MAXN], c[26];
string s, t;
int main() {
	cin.tie(0); ios_base::sync_with_stdio(0);
	cin >> s >> t;
	for (int i = 0; i < 26; i++) c[i] = s.size();
	for (int i = (int)s.size() - 1; i >= 0; i--) {
		c[s[i] - 'a'] = i;
		for (int j = 0; j < 26; j++) pos[j][i] = c[j];
	}
	long long ans = 0;
	for (int l = 0; l < s.size(); l++) {
		int r = l;
		int p = 0;
		while (p < t.size() && r < s.size() && pos[t[p] - 'a'][r] != s.size()) {
			r = pos[t[p] - 'a'][r] + 1;
			p++;
		}
		if (p == t.size())
			ans += s.size() - r + 1;
	}
	cout << ans;
}