#include <bits/stdc++.h>
using namespace std;
char s[100010], t[100010];
int n, m;
int nxt[100010][26];
int main() {
	scanf("%s%s", s + 1, t + 1);
	n = strlen(s + 1), m = strlen(t + 1);
	for (int i = n; i > 0; i--) {
		for (int j = 0; j < 26; j++) nxt[i][j] = nxt[i + 1][j];
		nxt[i][s[i] - 'a'] = i + 1;
	}
	int cur = 1;
	int ans = 0;
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < t[i + 1] - 'a'; j++) if (nxt[cur][j]) {
			ans = max(ans, i + n - nxt[cur][j] + 2);
		}
		if (i == m - 1 || nxt[cur][t[i + 1] - 'a'] == 0) break;
		cur = nxt[cur][t[i + 1] - 'a'];
		ans = max(ans, i + 1);
	}
	cout << n - ans << endl;
}