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.util.Scanner;

/* Name of the class has to be "Main" only if the class is public. */
public class Main
{
	public static void main (String[] args) throws java.lang.Exception
	{
		try {
		    Scanner sc = new Scanner(System.in);
		    String s,t;
		    int c,m,i,j;
		    s=sc.nextLine();
		    t=sc.nextLine();
		    m=2147483647;
		    c=0;
		    for(i=0;i<=(s.length()-t.length());i++)
		    {
		        c=0;
		      for(j=i;j<(i+t.length());j++)
		        {
		        if(s.charAt(j)!=t.charAt(j-i))
		          c++;
		        }
		       
		       if(c<m)
		        m=c;
		    }
		    System.out.println(m);
		    
		} catch(Exception e) {
		}
	}
}
