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 main
    implicit none
    character(1000)::s,t
    integer::n,m,ans,i,j,nm
    integer,allocatable::aaa(:)

    ans=0

    read*,s,t
    !print*,s,t

    n=len_trim(s)
    m=len_trim(t)
    nm=n-m
    !print*,n,m,nm
    allocate(aaa(nm+1))
    !print*,s(n:n),t(m:m)
    if(nm==0) then
        do i=1,m
            if(s(i:i)/=t(i:i)) then
                !print*,s(i:i)
                ans=ans+1
            end if
        end do
        go to 100
    end if

    
    ans=0
    if(nm>0) then
        !print*,s(1:1)
        do i=1,nm+1
            aaa(i)=0
            do j=i,m+i-1
               ! print*,s(j:j)
                if(s(j:j)/=t(j-i+1:j-i+1)) then
                   ! print*,s(j:j)
                    aaa(i)=aaa(i)+1
                end if
            end do
        end do
        ans=minval(aaa)
    end if

100 print*,ans
end program main