Similarity

Byteman is a computer scientist who designs algorithms for strings, patterns, texts, and the like. His current task is to build a tool that computes the similarity between a pattern and a text.

Given a pattern and a text, they can be aligned in many ways so that each letter of the pattern corresponds to a letter of the text. Here we consider only alignments without holes: the pattern is matched against a consecutive part of the text whose length equals the length of the pattern. For any such alignment, we count the number of positions where the pattern's letter equals the corresponding letter of the text. The similarity of the pattern and the text is the sum of these counts over every possible alignment.

The figure below illustrates how the similarity between the pattern abaab and the text aababacab is computed.

Given the pattern and the text, compute their similarity.

The input consists of two lines. The first line contains a non-empty string of lowercase English letters — the pattern. The second line contains a non-empty string of lowercase English letters — the text. The length of the pattern does not exceed the length of the text. The text contains at most 2 000 000 letters.

Print a single line containing the similarity of the given pattern and text.