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: Wrong Answer)

program main
  implicit none
  character(len=1000) :: S,T
  integer :: len_S, len_T
  !
  integer :: i, j
  integer,allocatable :: counter(:)
  read(*,*) S
  read(*,*) T
  len_S = len(trim(S))
  len_T = len(trim(T))

  allocate(counter(len_S-len_T))
  counter = 0
  do i = 1, len_S-len_T
     do j  = 0,len_T-1
        if (S(i+j:i+j) == T(j+1:j+1)) counter(i) = counter(i) + 1
     end do
  end do
  write(*,'(i0)') len_T- maxval(counter)
  stop
end program main