Given are two strings S and T.

Let us change some of the characters in S so that T will be a substring of S.

At least how many characters do we need to change?

Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Constraints

* The lengths of S and T are each at least 1 and at most 1000.
* The length of T is at most that of S.
* S and T consist of lowercase English letters.

Input

Input is given from Standard Input in the following format:


S
T


Output

Print the minimum number of characters in S that need to be changed.

Examples

Input

cabacc
abc


Output

1


Input

codeforces
atcoder


Output

6
import java.io.*;

class Main
{
    public static void main(String args[])throws Exception
    {
        BufferedReader bu=new BufferedReader(new InputStreamReader(System.in));
        StringBuilder sb=new StringBuilder();
        int min=Integer.MAX_VALUE;
        char s[]=bu.readLine().toCharArray(),t[]=bu.readLine().toCharArray();
        int i,j,c,n=s.length,m=t.length;
        for(i=0;i<n;i++)
        {
            if(i+m>n) break;
            c=0;
            for(j=0;j<m;j++)
            if(s[i+j]!=t[j]) c++;
            min=Math.min(min,c);
        }
        System.out.print(min);
    }
}
