#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
char S[maxn],T[maxn];
int n,m,ans=1e8,Bakward[maxn][26];
int main(){
	scanf("%s%s",(S+1),(T+1)),n=strlen(S+1),m=strlen(T+1);
	for(int i=m;i>=1;i--){
		for(int j=0;j<26;j++){
			Bakward[i][j]=(i!=m?Bakward[i+1][j]:m+1);	
		}
		Bakward[i][T[i]-'a']=i;
	}
	for(int i=1,pos=0,sum=0;(i<=n&&pos<=m);i++){
		int Themin=m+1;
		for(int j=0;j<(S[i]-'a');j++){
			Themin=min(Themin,Bakward[pos+1][j]);
		}
		ans=min(ans,sum+Themin-pos-1),sum+=Bakward[pos+1][S[i]-'a']-pos-1,pos=Bakward[pos+1][S[i]-'a'];
	}
	cout<<ans;return 0;
}