 # Simple Queries

You are given an array A having N integers.

You have to perform the following steps in a given order.

1. generate all subarrays of A.
2. take the maximum element from each subarray of A and insert it into a new array G.
3. replace every element of G with the product of their divisors mod 1e9 + 7.
4. sort G in descending order
5. perform Q queries

In each query, you are given an integer K, where you have to find the Kth element in G.

Note: Your solution will run on multiple test cases so do clear global variables after using them.

Input Format

``````The first argument given is an Array A, having N integers.
The second argument given is an Array B, where B[i] is the ith query.
``````

Output Format

``````Return an Array X, where X[i] will have the answer for the ith query.
``````

Constraints

``````1 <= N <= 1e5
1 <= A[i] <= 1e5
1 <= Q <= 1e5
1 <= k <= (N * (N + 1))/2
``````

For Example

``````Input:
A = [1, 2, 4]
B = [1, 2, 3, 4, 5, 6]
Output:
X = [8, 8, 8, 2, 2, 1]

Explanation:
subarrays of A	  maximum element
------------------------------------
1. 							1
2. [1, 2]						2
3. [1, 2, 4]					4
4. 							2
5. [2, 4]						4
6. 							4

original
G = [1, 2, 4, 2, 4, 4]

after changing every element of G with product of their divisors
G = [1, 2, 8, 2, 8, 8]

after sorting G in descending order
G = [8, 8, 8, 2, 2, 1]
``````
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details. 