Count the number of times the target string $T$ appears in the search string $S$.

Input

Two lines, corresponding to $S$ and $T$ respectively.

Output

The answer as an integer.

Constraints

• $|S|, |T| \le 10^6$
• $S, T$ only consists of lowercase alphabet characters.