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.*;
class Main{
  public static void main(String[] args){
    Scanner sc=new Scanner(System.in);
    String s=sc.next();
    String t=sc.next();
    char[] ss=new char[s.length()];
    char[] tt=new char[t.length()];
    for(int i=0;i<ss.length;i++){
      ss[i]=s.charAt(i);
    }
    for(int i=0;i<tt.length;i++){
      tt[i]=t.charAt(i);
    }
    int count;
    int min=tt.length;
    for(int i=0;i<1+ss.length-tt.length;i++){
      count=0;
      int j=i,k=0;
      while(k<tt.length){
        if(ss[j]!=tt[k]) count++;
        j++;k++;
      }
      if(min>count)min=count;
    }
    System.out.println(min);
  }
}