class Solution(object):

```
def findAnagrams(self, s, p):
if len(s)<len(p): return []
if len(s)==0:return []
a=len(s)-len(p)
l1=[]
for i in range(0,a+1):
if sorted(p)==sorted(s[i:i+len(p)]):
l1.append(i)
return l1
```