Please solve the programming task below using a self-contained code snippet in a markdown code block.

We define the string base to be the infinite wraparound string of "abcdefghijklmnopqrstuvwxyz", so base will look like this:

"...zabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcd....".

Given a string s, return the number of unique non-empty substrings of s are present in base.
 
Please complete the following python code precisely:
```python
class Solution:
    def findSubstringInWraproundString(self, s: str) -> int:
```