### 1559: Beautiful Array

[状态] [讨论版] [提交] [命题人:]

Senior Pan has two positive integers x and y, and she calls an array is a beautiful array if and only if it satisfies the following conditions:
The elements in the array are integers.
The length of the array is exactly y.
The product of each element is exactly x.
Senior Pan wants you to help her calculate the number of beautiful arrays for different x and y.Two arrays A and B are considered different if there exists a position i that Ai ≠ B.
The answer can be very large, so you can just tell her the number mod 109+7.
For example, if x is 2 and y is 2, there are four beautiful arrays: [1, 2], [2, 1] ,[−1, −2], [−2, −1].

The first line is an integer T, denoting the number of test cases.
For the following T lines, each line contains two positive integers x and y.
1 ≤ T ≤ 105,  x, y ≤ 2 ∗ 106

Output T lines, each line contains an integer, representing the number of beautiful array mod 109+7.

2
2 2
4 2

4
6