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)

S = gets.chomp
T = gets.chomp

s_n = S.split("")
t_n = T.split("")
l = T.length
ans = l
t_n.each.with_index do |t, idx_t|
  s_n.filter_map.with_index{ |e, i| i if e == t}.each do |idx_s|
    next if idx_s + (l - idx_t) >= S.length
    next if idx_t > idx_s
    nomatch = idx_t
    (1...(l-idx_t)).each do |i|
      nomatch += 1 unless t_n[idx_t+i] == s_n[idx_s+i]
    end
    ans = [ans, nomatch].min
  end
end
p ans