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.Arrays;

public class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    String s = sc.nextLine();
    String t = sc.nextLine();
    char[] sChar = s.toCharArray();
    char[] tChar = t.toCharArray();
    int ans = t.length();
    int searchN = s.length() - (t.length() - 1);
    for (int cnt = 0; cnt < searchN; cnt++) {
      int diffC = 0;
      for (int cnt2 = 0; cnt2 < t.length(); cnt2++) {
        if (sChar[cnt2 + cnt] != tChar[cnt2]) {
          diffC++;
        }
      }
      ans = Math.min(diffC, ans);
    }
    System.out.println(ans);
    sc.close();
  }
}