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 Haskell (GHC 8.8.3) (judge verdict: Runtime Error)

import           Control.Monad
import           Data.Maybe

input :: IO (String, String)
input = do
  s <- getLine
  t <- getLine
  return (s, t)


diff :: String -> String -> Maybe Int
diff [] y = Nothing
diff x [] = Just 0
diff (x:xs) (y:ys) = if x /= y then (liftM2 (+)) (Just 1) (diff xs ys) else diff xs ys


check :: (String, String) -> [Maybe Int] -> [Maybe Int]
check ([], t) ns       = ns
check (s@(_:ss), t) ns = check (ss, t) ((diff s t) : ns)

output :: [Maybe Int] -> Int
output ns = fromJust . minimum . filter (/= Nothing) $ ns

main :: IO ()
main = do
  (s, t) <- input
  let
    result = output $ check (s, t) []
  print result