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

public class Main {
    public static void main(String[] args) throws Exception {
        // Your code here!
        Scanner sc = new Scanner(System.in);
        String str = sc.next();
        char[] c1 = str.toCharArray();
        str = sc.next();
        char[] c2 = str.toCharArray();
        
        int min = 100000;
        for (int i = 0; i < c1.length - c2.length+1; i++) {
            int now = 0;
            for (int j = 0; j < c2.length; j++) {
                if (c1[j+i] != c2[j]) now++;
            }
            
            min = Math.min(min, now);
        }
        System.out.println(min);
    }
}
