//T1
//你 cnt=1 了吗？
#include<bits/stdc++.h>
#define int long long
#define mid ((l+r)>>1)
#define fir first
#define sec second
#define lowbit(i) (i&(-i))
using namespace std;
const int N=5e5+5;
const int inf=1e18;
struct edge{int to,nxt,l;};
inline int read(){
    char op=getchar();
    int w=0,s=1;
    while(op<'0'||op>'9'){
        if(op=='-') s=-1;
        op=getchar();
    }
    while(op>='0'&&op<='9'){
        w=(w<<1)+(w<<3)+op-'0';
        op=getchar();
    }
    return w*s;
}
//数论部分
const double pi=acos(-1);
const int mod=1e9+7;
int Mul(int a,int b){return (a%mod*b%mod)%mod;}
int Add(int a,int b){return (a+b)%mod;}
int Dec(int a,int b){return (a-b+mod)%mod;}
int Pow(int a,int k){
    int ans=1;
    while(k){
        if(k&1) ans=Mul(ans,a);
        a=Mul(a,a);
        k>>=1;
    }
    return ans;
}
int gcd(int x,int y){return y==0?x:gcd(y,x%y);}
int lcm(int x,int y){return x/gcd(x,y)*y;}
int inv(int x){return Pow(x,mod-2);}
void exgcd(int a,int b,int &x,int &y){
    if(b==0){
        x=1,y=0;
        return;
    }
    exgcd(b,a%b,x,y);
    int t=x;
    x=y;
    y=t-a/b*y;
}
int dp[N][2];
char s[N],t[N];
vector<int> v[28];
signed main(){
    // freopen("string.in","r",stdin);
    // freopen("string.out","w",stdout);
    scanf("%s",t+1),scanf("%s",s+1);
    int n=strlen(s+1),m=strlen(t+1);
    for(register int i=1;i<=m;i++){
        int ch=t[i]-'a'+1;
        v[ch].push_back(i);
    }
    int ans=inf;
    for(register int i=1;i<=n;i++){
        int ch=s[i]-'a'+1;
        vector<int>::iterator k=upper_bound(v[ch].begin(),v[ch].end(),dp[i-1][0]);
        if(k!=v[ch].end()) dp[i][0]=*k;
        else dp[i][0]=inf;
        dp[i][1]=inf;
        for(register int j=1;j<ch;j++){
            k=upper_bound(v[j].begin(),v[j].end(),dp[i-1][0]);
            if(k!=v[j].end()) dp[i][1]=min(dp[i][1],*k);
        }
        if(dp[i][0]==inf&&dp[i][1]==inf&&dp[i-1][0]!=inf) ans=min(ans,m-i+1);
        if(dp[i][0]>0&&dp[i][0]!=inf&&i!=1) ans=min(ans,m-i+1);
        if(dp[i][0]>0&&dp[i][0]!=inf&&i==1) ans=min(ans,m);
        ans=min(ans,dp[i][1]-i);
        // printf("%lld %lld\n",dp[i][0],dp[i][1]);
    }
    printf("%lld",ans);
} 
/*
aaaaaaaaaaaaaaaaaaaaaa
abbbbbbbbbbbbbbbbbbbbb

hyddakioi
whywillaknoi

whqwillsingatninepm
dajiabujianbusan

ahhhhhhhhhhhhhhflowerletterishuahua
heisanoierinhighschoolaffiliatedtorenminuniversityofchina

ab
aca

aaaaaaa
aa

aa
aaaaaaa

a
b

hj
hjp
*/