Given a string and a pattern, your task is to count the number of positions where the pattern occurs in the string.
The first input line has a string of length $n$ , and the second input line has a pattern of length $m$ . Both of them consist of characters a–z.
Print one integer: the number of occurrences.