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) {
		var sc = new Scanner(System.in);
		var s = sc.next();
		var t = sc.next();
		sc.close();

		var result = Integer.MAX_VALUE;
		for (var i = 0; i < s.length() - t.length() + 1; i++) {
			var count = 0;
			for (var j = 0; j < t.length(); j++) {
				var s1 = s.substring(i + j, i + j + 1);
				var t1 = t.substring(j, j + 1);
				if (!s1.equals(t1)) {
					count++;
				}
			}
			result = Math.min(result, count);
		}

		System.out.println(result);
	}
}
