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 Kotlin (1.3.71) (judge verdict: Accepted)

fun main(args: Array<String>) {
	val s = readLine() ?: return
	val t = readLine() ?: return
	
	println(theNumberOfDifference(s, t))
}

fun theNumberOfDifference(baseString: String, partOfString: String) : Int {

	var difference: Int
	var minDifference = partOfString.length
	
	for (i in 0..(baseString.length - partOfString.length)) {
		difference = 0
		for ((index, char) in partOfString.withIndex()) {
			if (char != baseString[i+index]) {
				difference++
			}
		}
		minDifference = minOf(difference, minDifference)
	}
	
	return minDifference
}