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

typedef long long ll;

const int MAXN = 1e5, MAXM = 100;
int n, m;
char s[MAXN + 5], t[MAXM + 5];

ll dp[MAXN + 5][MAXM + 5];

int main() {
	cin >> (s + 1);
	cin >> (t + 1);
	
	n = strlen(s + 1);
	m = strlen(t + 1);
	
	for (int i = 1; i <= n; ++i) {
		for (int j = 0; j < m; ++j) {
			if (dp[i - 1][j]) {
				if (s[i] != t[j + 1]) {
					dp[i][j] += dp[i - 1][j];
				} else if (j + 1 < m) {
					dp[i][j + 1] += dp[i - 1][j];
				}
			}
		}
		if (s[i] != t[1]) {
			dp[i][0]++;
		} else if (m > 1) {
			dp[i][1]++;
		}
	}
	
	ll res = 0;
	for (int i = 1; i <= n; ++i) {
		for (int j = 0; j < m; ++j) {
			res += dp[i][j];
		}
	}
	
	// cout << res << endl;
	
	cout << (ll)n * (n + 1) / 2 - res << endl;
	
	return 0;
}