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.BufferedReader;
import java.io.InputStreamReader;

public class Main {

  public static void main(String[] args) throws Exception {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    String s = br.readLine();
    String t = br.readLine();
    br.close();
    int s_len = s.length();
    int t_len = t.length();
    int answer = t.length();
    for(int s_idx = 0; s_idx <= s_len - t_len; s_idx++){
      int diff_cnt = 0;
      for(int t_idx = 0; t_idx < t_len; t_idx++){
        if(s.charAt(s_idx + t_idx) != t.charAt(t_idx)) diff_cnt++;
      }
      answer = Math.min(answer, diff_cnt);
    }
    System.out.println(answer);
  }
}