The factor Trader has been asked to map a faster supply route. On the desk lies a long table of sigils readings. Task: Count how many times string t occurs inside s (occurrences may overlap). Input format: Two lines: string s, then pattern t. Output format: Print the occurrence count. Constraints: 1 <= |t| <= |s| <= 1955; lowercase letters.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= |t| <= |s| <= 1955; lowercase letters.
