Killjee gives you two strings $S$ and $T$. You need to find how many times string $T$ occur in string $S$ as, a substring.

INPUT

Input has two lines, First line contains string $S$ and second line contain string $T$.

OUTPUT

Print frequency of occurence of string $T$ as substring of string $S$.

CONSTRAINTS

• $1 \le |S| \le |T| \le 10^7$