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;
public class Main {

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		String s = scan.next();
		String t = scan.next();
		char[] cs = new char[s.length()];
		char[] ct = new char[t.length()];
		boolean[] count = new boolean[1001];
		int max = 0;
		
		for(int i=0;i<s.length();i++) {
			cs[i] = s.charAt(i);
		}
		
		for(int i=0;i<t.length();i++) {
			ct[i] = t.charAt(i);
		}
		
		for(int i=0;i<=s.length()-t.length();i++) {
			int n = 0;
			for(int j=0;j<t.length();j++) {
				if(cs[i+j] == ct[j]) {
					n++;
				}
			}
			max = Math.max(max, n);
			count[n] = true;
		}
		
		System.out.println(t.length()-max);

	}

}