<p>You are given a string <code>s</code> containing one or more words. Every consecutive pair of words is separated by a single space <code>&#39; &#39;</code>.</p>

<p>A string <code>t</code> is an <strong>anagram</strong> of string <code>s</code> if the <code>i<sup>th</sup></code> word of <code>t</code> is a <strong>permutation</strong> of the <code>i<sup>th</sup></code> word of <code>s</code>.</p>

<ul>
	<li>For example, <code>&quot;acb dfe&quot;</code> is an anagram of <code>&quot;abc def&quot;</code>, but <code>&quot;def cab&quot;</code>&nbsp;and <code>&quot;adc bef&quot;</code> are not.</li>
</ul>

<p>Return <em>the number of <strong>distinct anagrams</strong> of </em><code>s</code>. Since the answer may be very large, return it <strong>modulo</strong> <code>10<sup>9</sup> + 7</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;too hot&quot;
<strong>Output:</strong> 18
<strong>Explanation:</strong> Some of the anagrams of the given string are &quot;too hot&quot;, &quot;oot hot&quot;, &quot;oto toh&quot;, &quot;too toh&quot;, and &quot;too oht&quot;.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;aa&quot;
<strong>Output:</strong> 1
<strong>Explanation:</strong> There is only one anagram possible for the given string.</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 10<sup>5</sup></code></li>
	<li><code>s</code> consists of lowercase English letters and spaces <code>&#39; &#39;</code>.</li>
	<li>There is single space between consecutive words.</li>
</ul>

class Solution:
    def __init__(self):
        self.factorialCache = [1, 1]
        self.mod = 1000000007

    def countAnagrams(self, s: str) -> int:
        currChars = {}
        total = 1
        cnt = 0
        for c in s:
            if c == ' ':
                total = (total * self.getCombos(sorted(x for x in currChars.values() if x > 1), cnt)) % self.mod
                currChars.clear()
                cnt = 0
            else:
                cnt += 1
                if currChars.get(c) == None:
                    currChars[c] = 1
                else:
                    currChars[c] += 1
        return (total * self.getCombos(list(x for x in currChars.values() if x > 1), cnt)) % self.mod

    def getCombos(self, denominators: List[int], cnt: int) -> int:
        result = 1
        numerators = list(range(2, cnt + 1))
        if len(denominators) != 0:
            productOffset = 0
            denominators = sorted(denominators)
            rem = []
            for n in reversed(range(2, denominators[-1] + 1)):
                numeratorIndex = n - 2
                for d in reversed(denominators):
                    if n > d:
                        break
                    while numeratorIndex < cnt - 1 and numerators[numeratorIndex] % n != 0:
                        numeratorIndex += n
                    if numeratorIndex < cnt - 1:
                        numerators[numeratorIndex] //= n
                    else:
                        rem.append(n)
                for remIndex in reversed(range(0, len(rem))):
                    while rem[remIndex] % n == 0:
                        while numeratorIndex < cnt - 1 and numerators[numeratorIndex] % n != 0:
                            numeratorIndex += n
                        if numeratorIndex < cnt - 1:
                            numerators[numeratorIndex] //= n
                            rem[remIndex] //= n
                        else:
                            break
        for n in numerators:
            if n != 1:
                result = (result * n) % self.mod
        return result

899