You are given a string, s, containing one or more words separated by a single space. Your task is to count and return the number of distinct anagrams of the entire string s. As the answer may be very large, return it modulo $10^9$ + $7$, i.e., return the remainder when the answer is divided by $10^9$ + $7$.

Note: An anagram is a word formed by rearranging the letters of another word, using all the original letters exactly once. For example, “listen” is an anagram of “silent”. Similarly, a string t is an anagram of string s if the ith word of t is a permutation of the ith word of s. For example, “silent era” is an anagram of “listen ear”, but "sline tear" is not.

Constraints:

• $1 \leq$ s.length $\leq 10^3$

• s consists of lowercase English letters and spaces ' '.

• There is only a single space between consecutive words.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.