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;
import java.util.*;
public class Main {
	public static String S;
	public static String T;
	public static int sub = Integer.MAX_VALUE;

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		S = scan.next();
		T = scan.next();
		System.out.println(search());
	}

	private static int search() {
		for (int i = 0;i <= S.length() - T.length() ;i++ ) {
			int count = 0;
			for (int j = 0;j < T.length() ;j++ ) {
				String s_i = S.substring(i + j,i + j + 1);
				String t_i = T.substring(j,j + 1);
				if (!s_i.equals(t_i)) count++;
			}
			sub = Math.min(sub,count);
		}
		return sub;
	}

}
