Update readme.md

Author: javadev

src/main/java/g1701_1800/s1735_count_ways_to_make_array_with_product/readme.md

@@ -12,7 +12,13 @@ Return _an integer array_ `answer` _where_ `answer.length == queries.length`_, a
 
 **Output:** [4,1,50734910]
 
-**Explanation:** Each query is independent. [2,6]: There are 4 ways to fill an array of size 2 that multiply to 6: [1,6], [2,3], [3,2], [6,1]. [5,1]: There is 1 way to fill an array of size 5 that multiply to 1: [1,1,1,1,1]. [73,660]: There are 1050734917 ways to fill an array of size 73 that multiply to 660. 1050734917 modulo 10<sup>9</sup> + 7 = 50734910.
+**Explanation:** Each query is independent.
+
+[2,6]: There are 4 ways to fill an array of size 2 that multiply to 6: [1,6], [2,3], [3,2], [6,1].
+
+[5,1]: There is 1 way to fill an array of size 5 that multiply to 1: [1,1,1,1,1].
+
+[73,660]: There are 1050734917 ways to fill an array of size 73 that multiply to 660. 1050734917 modulo 10<sup>9</sup> + 7 = 50734910.
 
 **Example 2:**
 
@@ -23,4 +29,4 @@ Return _an integer array_ `answer` _where_ `answer.length == queries.length`_, a
 **Constraints:**
 
 *   <code>1 <= queries.length <= 10<sup>4</sup></code>
-*   <code>1 <= n<sub>i</sub>, k<sub>i</sub> <= 10<sup>4</sup></code>
+*   <code>1 <= n<sub>i</sub>, k<sub>i</sub> <= 10<sup>4</sup></code>