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.*;
import java.io.*;
import java.lang.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String a = sc.next();
        String b = sc.next();

        ArrayList<Integer> arr = new ArrayList<Integer>();

        int la = a.length();
        int lb = b.length();

        for (int i = 0; i < (la-lb+1);i++){
            String c = a.substring(i,i+lb);
            int cu = 0;
            for (int j = 0; j<lb;j++){
                if (c.charAt(j) != b.charAt(j))
                    cu++;
            }
            arr.add(cu);
        }
        System.out.println(Collections.min(arr));
    }
}