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 Ruby (2.7.1) (judge verdict: Wrong Answer)

#!/usr/bin/env ruby

# https://atcoder.jp/contests/abc177/tasks/abc177_b
# 2 つの文字列 S , T が与えられます。
# T が S の部分文字列となるように、 S のいくつかの文字を書き換えます。
# 少なくとも何文字書き換える必要がありますか？

#i = gets
#str1, str2 = i.chomp.split(" ")

str1 = gets
str2 = gets

if str1.index(str2)
  puts "0"
  return
end

len = str2.length
(len - 1).downto(1).each { |i|
  0.upto(len - i).each{ |j|
    sub = str2[j, i]
    pos = str1.index(sub)
    # puts "#{str1} #{sub} #{pos}"
    if pos && pos >= 0 && pos >= j
      puts (len - i)
      return
    end
  }
}
puts len