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 Python (3.8.2) (judge verdict: Wrong Answer)

S = input()
T = input()
i = len(T)

ans = -1
while i > 0:
    if ans != -1:
        break
    sub_str = T[0:i]
    r = 0
    while r + len(sub_str) <= len(S):
        sub2 = S[r:r+len(sub_str)]
        r+=1
        if sub_str == sub2:
            print(sub_str)
            ans = len(T) - len(sub_str)
            break
    i-=1
if ans != -1:
    print(ans)
else:
    for i, s in enumerate(list(T)):
        remaining = len(T) - i
        if s in T and S.find(s) + remaining <= len(S):
            ans = len(T) - 1
    if ans != -1:
        print(ans)
    else:
        print(len(T))