- Time limit: 1.00 s
- Memory limit: 512 MB
Input
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.
Output
Print one integer: the number of occurrences.
Constraints
- $1 \le n,m \le 10^6$
Input:
saippuakauppias
pp
Output:
2