PROGRAMMING:Substring number matching

Input two strings a and B respectively. A is composed of several small strings (separated by non letters) and B is composed of letters. Find out the number of small strings containing B in a (see the example for details), and output it（ (case insensitive)
###Input format:
Enter the string a first and end with carriage return. Then enter the string B.
###Output format:
The output a contains the number of B strings
###Input example:
Here is a set of inputs. For example:
```in
aaBbc4./ewfeAbc wefW%!%& aAbc++0 4Abccabc
aBc
```
###Output example:
The corresponding output is given here. For example:
```out
three
```
Explanation:
A can be seen as: aabbc ewfeabc wefw AABC abccabc small string composition of the string.
There are: ewfeabc AABC abccabc (3) < br > < br > < br > < br > < br > including B


answer：If there is no answer, please comment