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.strip.split('')
t = gets.strip.split('')


res = 0
t.each_with_index do |e, i|
  mx = 0
  start1 = i
  start2 = -1
  s.each_with_index do |e1, j|
    if t[start1] != e1
      if i <= start2 && t.size - start1  <= s.size - j - 1 && start2 != -1
        res = [res, mx].max
      end
      mx = 0
      start1 = i
      start2 = -1
    end
    if t[start1] == e1
      start2 = j if mx.zero?
      start1 += 1
      mx += 1
    end
    if t[start1 - 1] == e1 && s.size - 1 == j
      if i <= start2 && t.size - start1  <= s.size - j - 1 && start2 != -1
        res = [res, mx].max
      end
      mx = 0
      start1 = i
      start2 = -1
    end
  end
end
puts t.size - res