#include<bits/stdc++.h>
#define ll long long
using namespace std;
char s[100005],t[100005];
int n,m,ans=1e9,cnt; 
int nxt[100005],lst[30];
int main(){
	cin>>(s+1)>>(t+1);
	n=strlen(s+1);m=strlen(t+1);
	for(int i=0;i<26;++i)lst[i]=m+1;
	for(int i=0;i<=m+1;++i)nxt[i]=m+1;
	for(int i=m;i>=1;--i){
		for(int j=t[i]-'a'-1;j>=0;--j)nxt[i]=min(nxt[i],lst[j]);
		lst[t[i]-'a']=i;
	}
//	cout<<nxt[5]<<endl;
//	for(int i=1;i<=m;++i)cout<<nxt[i]<<" ";puts("");
	int now=1;
	for(int i=1;i<=n;++i){
		while(t[now]>s[i]&&now<=m)now++,cnt++;
		if(t[now]<s[i])return cout<<min(ans,cnt),0;
		if(t[now]==s[i]){
			ans=min(ans,cnt+nxt[now]-now);
		}
		now++;
	}
	cout<<ans;
	return 0;
}
/*
ahhhhhhhhhhhhhhflowerletterishuahua
heisanoierinhighschoolaffiliatedtorenminuniversityofchina

aacbbbbaaaaaaaaaba
db

whqwillsingatninepm
dajiabujianbusan

hyddakioi
whywillaknoi
*/