#abc196f. [abc196_f]Substring 2

[abc196_f]Substring 2

Problem Statement

Given are strings SS and TT consisting of 0 and 1.
We will change some of the characters in TT so that TT becomes a substring of SS.
How many characters do we need to change at least?

What is a substring? TT is said to be a substring of SS when some contiguous part of SS matches TT. For example, 000 is a substring of 10001, while 11 is not.

Constraints

  • Each of SS and TT consists of 0 and 1.
  • 1TS1061 ≤ |T| ≤ |S| ≤ 10^6

Input

Input is given from Standard Input in the following format:

SS TT

Output

Print the answer.


Sample Input 1

0001
101

Sample Output 1

1

Changing TT to 001 makes it match the 22-nd through 44-th characters of SS.


Sample Input 2

0101010
1010101

Sample Output 2

7

Sample Input 3

10101000010011011110
0010011111

Sample Output 3

1