You are given 2 string $S$ and $T$. Count the number of occurrences of $T$ in $S$ (i.e. how many substrings of $S$ equal to $T$).
### Input
- First line contains string $S$.
- Second line contains string $C$.
### Output
- The number of occurrences of $T$ in $S$.
### Constraints
- $1 \le |T| \le |S| \le 1000$.
### Example
Input:
```
asasa
asa
```
Output:
```
2
```
