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
#include<iostream>
#include<cstring>
using namespace std;
string s1,s2;
int main(){
	cin>>s1>>s2;
	int l1=s1.size(),l2=s2.size();
	int ans=2e9+10;
	for(int i=0;i<=l1-l2;i++){
		int s=0;
		for(int j=0;j<l2;j++)
			if(s1[i+j]!=s2[j])
				s++;
		ans=min(ans,s);
	}
	cout<<ans<<'\n';
}