608_B. Hamming Distance Sum
Genos needs your help. He was asked to solve the following programming problem by Saitama:

The length of some string s is denoted |s|. The Hamming distance between two strings s and t of equal length is defined as <image>, where si is the i-th character of s and ti is the i-th character of t. For example, the Hamming distance between string "0011" and string "0110" is |0 - 0| + |0 - 1| + |1 - 1| + |1 - 0| = 0 + 1 + 0 + 1 = 2.

Given two binary strings a and b, find the sum of the Hamming distances between a and all contiguous substrings of b of length |a|.

Input

The first line of the input contains binary string a (1 ≤ |a| ≤ 200 000).

The second line of the input contains binary string b (|a| ≤ |b| ≤ 200 000).

Both strings are guaranteed to consist of characters '0' and '1' only.

Output

Print a single integer — the sum of Hamming distances between a and all contiguous substrings of b of length |a|.

Examples

Input

01
00111


Output

3


Input

0011
0110


Output

2

Note

For the first sample case, there are four contiguous substrings of b of length |a|: "00", "01", "11", and "11". The distance between "01" and "00" is |0 - 0| + |1 - 0| = 1. The distance between "01" and "01" is |0 - 0| + |1 - 1| = 0. The distance between "01" and "11" is |0 - 1| + |1 - 1| = 1. Last distance counts twice, as there are two occurrences of string "11". The sum of these edit distances is 1 + 0 + 1 + 1 = 3.

The second sample case is described in the statement.
```python
from sys import  stdin
input=stdin.readline
'''
if i+k
'''
def getcnt(a):
    cnt=[[0,0] for i in range(len(a)+1)]
    for i in range(len(a)):
        # if i==0:
        #     cnt[i][a[i]]+=1
        # else:
        cnt[i+1][0]=cnt[i][0]
        cnt[i+1][1]=cnt[i][1]
        cnt[i+1][a[i]]+=1
    return cnt
def f(a,b):
    ans=0
    a=list(map(int,list(a)))
    b=list(map(int,list(b)))
    lb=len(b)
    la=len(a)
    cnt=getcnt(a)
    ans=0
    for i in range(len(b)):
        lo=max(0,i-(lb-la))
        hi=min(i+1,la)
        # print(lo,hi)
        # if lo==0:
        #     lr=[0,0]
        # else:
        lr=cnt[lo]
        rr=cnt[hi]
        t=list(map(lambda x,y:x-y,rr,lr))
        ans+=t[b[i]^1]

    return ans


s=input().strip()
t=input().strip()
print(f(s,t))
```