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();
		char[] s = S.toCharArray();
		char[] t = T.toCharArray();
		int slen = s.length;
		int tlen = t.length;
		
		//答えansを仮置きする。
		//これが十分に大きくないと不正解となるので、
		//この値なら絶対に正しい答えが出る、という値を仮置きすること
		int ans = tlen;
		
		for(int start = 0; start <= slen-tlen; start++){
			int diff = 0;
			for(int i = 0; i < tlen; i++){
				if(t[i] != s[start+i]){
					diff++;
				}
			}
			ans = Math.min(ans, diff);
		}
		
		System.out.println(ans);
	}
}