Count Ways to Make Array With Product

You are given a 2D integer array, queries . For each queries[i] , where queries[i] = [n _i , k _i ] , find the number of different ways you can place positive integers into an array of size n _i such that the product of the integers is k _i . As the number of ways may be too large, the answer to the i ^th query is the number of ways modulo 10 ^9 + 7 .

Return an integer array answer where answer.length == queries.length , and answer[i] is the answer to the i ^th query.