Problem:
Score : 200 points

Problem Statement

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.

Sample Input 1

cabacc
abc

Sample Output 1

1

For example, changing the fourth character a in S to c will match the second through fourth characters in S to T.

Since S itself does not have T as its substring, this number of changes - one - is the minimum needed.

Sample Input 2

codeforces
atcoder

Sample Output 2

6

Solution in Fortran (GNU Fortran 9.2.1) (judge verdict: Accepted)

program p2
    implicit none
    character(len=1005)::s, t
    integer::tmp, ans, i, j, ls, lt
    read(*,*) s, t
    ls = len_trim(s)
    lt = len_trim(t)
    ans = lt
    do i = 1, ls-lt+1
        tmp = 0
        do j = 1, lt
            if(s(i+j-1:i+j-1) .ne. t(j:j))  tmp = tmp + 1
        end do
        ans = min(tmp,ans)
    end do
    write(*,*) ans
    stop
end program