You are given two integers n and maxValue.

An array arr of length n is called ideal if:

• Every element satisfies $1 \leq$ arr[i] $\leq$ maxValue for all $0 \leq$ i $<$ n.

• For every index i such that $1 \leq$ i $<$ n, arr[i] is divisible by arr[i - 1].

Return the total number of distinct ideal arrays of length n. Since the answer may be very large, return it modulo $10^9 + 7$.

Constraints:

• $2 \leq$ n $\leq 10^4$

• $1 \leq$ maxValue $\leq 10^4$

Now, 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.