Queries for the product of first N factorials

<script>
    // Javascript implementation of the approach 
    
    let MAX = 1000000;
  
    let MOD = 10000007;

    // Declare result array globally
    let result = new Array(MAX + 1);
    result.fill(0);
    let fact = new Array(MAX + 1);
    fact.fill(0);

    // Function to precompute the product
    // of factorials upto MAX
    function preCompute()
    {

        // Initialize base condition if n = 0
        // then factorial of 0 is equal to 1
        // and answer for n = 0 is 1
        fact[0] = 1;
        result[0] = 1;

        // Iterate loop from 1 to MAX
        for (let i = 1; i <= MAX; i++) 
        {

            // factorial(i) = factorial(i - 1) * i
            fact[i] = ((fact[i - 1] % MOD) * i) % MOD;

            // Result for current n is equal to result[i-1]
            // multiplied by the factorial of i
            result[i] = ((result[i - 1] % MOD) * 
                         (fact[i] % MOD)) % MOD;
        }
    }

    // Function to perform the queries
    function performQueries(q, n)
    {

        // Precomputing the result till MAX
        preCompute();

        // Perform queries
        for (let i = 0; i < n; i++)
            document.write(result[q[i]] + "</br>");
    }
    
    let q = [ 4, 5 ];
    let n = q.length;
      
    performQueries(q, n);
    
</script>