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.io.InputStream;
import java.io.PrintStream;
import java.util.Scanner;

public class Main {

  public static void main(String[] args) {
    resolve(System.in, System.out);
  }

  static void resolve(InputStream is, PrintStream pw) {
    Scanner sc = new Scanner(is);
    String s = sc.next();
    String t = sc.next();
    int ans = t.length();
    for (int i = 0; i <= s.length() - t.length(); i++) {
      ans = Math.min(countDiff(s.substring(i, i + t.length()), t), ans);
    }
    pw.println(ans);
  }

  static int countDiff(String subS, String t) {
    int diff = 0;
    for (int i = 0; i < subS.length(); i++) {
      if (subS.charAt(i) != t.charAt(i)) {
        diff++;
      }
    }
    return diff;
  }
}
