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;

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

        // 本文
        String s = sc.next();
      	int sL=s.length();

        // 部分
        String t = sc.next();
     	int tL=t.length();
      	
      	//何文字あっているか
      	int[] point=new int[sL-tL+1];
      
      	int maxPoint=0;

		for(int i=0;i<(sL-tL+1);i++){
          for(int j=0;j<tL;j++){
            if(s.charAt(i+j)==t.charAt(j)){
              point[i]+=1;
            }
          }
          if(maxPoint<=point[i]){
            maxPoint=point[i];
          }
        }
      
      	System.out.println(tL-maxPoint);
      
      
      
      
    }
}