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.*;

public class Main{
    public static void main(String[] args){
	Scanner sc = new Scanner(System.in);
	String s = sc.next();
	String t = sc.next();
	int[] pin = new int[s.length()];

	if(s.contains(t)) System.out.println(0);
	else {
	    for(int i=0; i<t.length(); i++){
		for(int i2=i; i2<s.length()-t.length()+i+1; i2++){
		    t=t+" ";
		    s=s+" ";
		    if(s.substring(i2,i2+1).equals(t.substring(i, i+1)))pin[i2-i]++;
		    t=t.trim();
		    s=s.trim();
		}		
	    }
	    int max=0;
	    for(int i=0; i<s.length(); i++){
		if(pin[i]>max){
		    max=pin[i];
		}
	    }		
	    System.out.println(t.length()-max);
	}
    }
}
