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 Julia (1.4.0) (judge verdict: Runtime Error)

parseInt(x) = parse(BigInt, x)
parseMap(x::Array{SubString{String},1}) = map(parseInt, x)
function main()
  S = readline()
  T = readline()
  sum=0
  if occursin(T,S)
    println(0)
  else
    tmax=0
    for i in 1:length(S)
      tmp=0
      la = length(T)
      if i > length(S)-length(T)+1
        la = length(S)-i
      end
      for j in 1:la
        if S[i+j-1] == T[j]
          tmp += 1
        end
      end
      if tmax < tmp
        tmax = tmp
      end
    end
  end
  println(length(T)-tmax)

end
main()