Modulo Confession

**Scenario.** A counting problem says the answer can be huge and must be printed modulo 10^9 + 7, with n ≤ 10^6. What does this confess? **Which approach is the best fit? The program only needs to print the letter.** **A)** The answer is small; brute force works **B)** The count must be computed by DP/combinatorics — enumeration is impossible **C)** The problem is actually about primes **D)** n must be smaller in real tests