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 {
	static char[]s;
	static char[]t;
	static int sl;
	static int tl;
	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc= new Scanner(System.in);
		
		String S= sc.nextLine();
		String T= sc.nextLine();
		
		sc.close();
		
		s= S.toCharArray();
		t= T.toCharArray();
		
		
		sl= s.length;
		tl= t.length;
		
		int hit=0;
		for(int left=0;left+tl<=sl;left++){
			int temp=0;
			for(int i=0;i<tl;i++)if(s[left+ i] == t[i])temp++;
			hit= Math.max(hit, temp);	
		}
		
		System.out.println(tl-hit);
	
	}
	

}
