Richard Hemming

In information theory, the Hamming distance between two strings of equal length is the number of positions at which the corresponding symbols are different. In another way, it measures the minimum number of substitutions required to change one string into the other, or the minimum number of errors that could have transformed one string into the other. Let us define Hamming distance as d(s1, s2). For example: d(tatuuf, tuitub)= 4, d(more, code)=2, d(algo, algo)=0. In this problem you are given two strings s and t. Your task is to calculate the sum of Hamming distances beetween t and all substrings of s.

Input

In the first line given s , in the secont given t. Both strings contain lowercase english letters (1≤|t|≤|s|≤10⁶). |x| - the length of string x.

Output

Output the answer to problem.

Examples