#include <stdio.h>
#include <string.h>

int nxt[100007][27];
char s[100007], t[100007];

inline int min(int a, int b){
	return a < b ? a : b;
}

int main(){
	int n, m, ni, ans = 0x7fffffff;
	scanf("%s", &s[1]);
	scanf("%s", &t[1]);
	n = strlen(&s[1]);
	m = strlen(&t[1]);
	ni = n + 1;
	for (int i = 1; i <= 26; i++){
		nxt[ni][i] = ni;
	}
	for (int i = n; i >= 1; i--){
		for (int j = 1; j <= 26; j++){
			nxt[i][j] = nxt[i + 1][j];
		}
		nxt[i][s[i] - 'a' + 1] = i;
	}
	for (int i = 0, j = 0; i < m; i++, j++){
		if (i > 0){
			j = nxt[j][s[i] - 'a' + 1];
			if (j > n) break;
		}
		int ch = t[i + 1] - 'a' + 1, cur_ans = n - j;
		for (int k = 1; k < ch; k++){
			if (nxt[j + 1][k] <= n) cur_ans = min(cur_ans, nxt[j + 1][k] - j - 1);
		}
		ans = min(ans, (j - i) + cur_ans);
	}
	printf("%d", ans);
	return 0;
}