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.*;
import java.util.*;
class Main
{
	public static void main(String args[]) throws IOException
	{
		try{
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		char a[]=br.readLine().toCharArray();
		char b[]=br.readLine().toCharArray();
		int ans=Integer.MAX_VALUE;int cou=0;int ind=0;
		for(int i=0;i<a.length-b.length+1;i++)
		{
			//System.out.print(a[i]+",");
			for(int j=i;j<i+b.length;j++)
			{
				if(b[ind++]!=a[j])
				{
					cou+=1;
				}
			}
			//System.out.println(cou);
			ans=Math.min(cou,ans);
			ind=0;cou=0;
		}
		System.out.println(ans);
	}
	catch(Exception e){}
}}