#include<bits/stdc++.h>
#define x first
#define y second
#define eb emplace_back
#define pb push_back
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define ROF(i,a,b) for(int i=(a);i>=(b);--i)
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define sz(x) (int)(x).size()
#define make_unique(x) sort(all(x)), (x).erase(unique(all(x)), (x).end())

using namespace std;

typedef long long i64;
//typedef __int128 i128;
typedef long double ld;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<i64> vl;
typedef vector<vl> vvl;
typedef pair<int,int> pii;
typedef pair<i64,i64> pll;
typedef tuple<int,int,int> iii;
typedef vector<pii> vpii;
typedef vector<pll> vpll;

int readInt() { int a; scanf("%d",&a); return a; }
i64 readLong() { i64 a; scanf("%lld",&a); return a; }
char readChar() { char a; scanf(" %c",&a); return a; }
double readDouble() { double a; scanf(" %lf",&a); return a; }
void readString(char *s) { scanf(" %s",s); }

const int mod = 998244353;
int add(int a, int b) { return ((a+=b)>=mod) ? a-mod:a; }
int mul(int a, int b) { return a*1ll*b%mod; }
int pw(int a, int b) {
	int ans = 1, res = a;
	for(int i = 1; i <= b; i*=2, res=mul(res,res)) {
		if(i&b) {
			ans = mul(ans, res);
		}
	}
	return ans;
}

const int N = 100005;

char S[N], T[N];

int dp[N][26];
int main() {
	readString(S+1);
	readString(T+1);

	int n = strlen(S+1);
	int m = strlen(T+1);

	int inf = (1<<30);
	
	FOR(i,0,25) dp[n+1][i] = inf;

	ROF(i,n,1) {
		FOR(j,0,25) dp[i][j] = dp[i+1][j];
		dp[i][S[i]-'a'] = i;
	}

	i64 ans = 0;

	FOR(i,1,n) {
		int cur = i-1;
		FOR(j,1,m) {
			cur = dp[cur+1][T[j]-'a'];
			if(cur == inf) break;
		}
		if(cur != inf) ans += (n-cur+1);
	}

	printf("%lld\n",ans);
	return 0;
}