Simple Python, Math Formula
Formula for anagram combinations is n! / (k1! * k2! * ... km!), where n is number of letters in word, k is count of letter in word (for all letters)\n\nSplit s 
Formula for anagram combinations is n! / (k1! * k2! * ... km!), where n is number of letters in word, k is count of letter in word (for all letters)\n\nSplit s and multiply the number of combinations for each word together.\n\nModulo by pow(10,9) + 7\n\n# Code\n```python3 []\nclass Solution:\n    def countAnagrams(self, s: str) -> int:\n        out = 1\n        words = s.split()\n        for w in words:\n            numerator = math.factorial(len(w))\n            denominator = 1\n            count = Counter(w)\n            for c in count:\n                denominator *= math.factorial(count[c])\n            out *= (numerator // denominator)\n        return out % (pow(10,9) + 7)\n```
['Python3']