#include <bits/stdc++.h>
using namespace std;
typedef int arr[300010];
long long ans, pw[2000010];
int q;
const int mod = (int)1e9 + 7;
long long Pow(long long a, long long b) {
  if (b == 0) return 1ll;
  long long R = Pow(a, b / 2);
  R = (R * R) % mod;
  if (b & 1) return (R * a) % mod;
  return R;
}
long long C(int n, int m) {
  if (m == 0) return 1;
  return pw[n] * Pow(pw[m], mod - 2) % mod * Pow(pw[n - m], mod - 2) % mod;
}
int main() {
  pw[0] = 1;
  for (int i = 1; i <= (int)2e6; i++) pw[i] = pw[i - 1] * i % mod;
  scanf("%d", &q);
  for (int x, y; q--;) {
    scanf("%d%d", &x, &y);
    ans = 1;
    for (int i = 2; 1LL * i * i <= x; i++)
      if (x % i == 0) {
        int num = 0;
        while (x % i == 0) num++, x /= i;
        ans = ans * C(num + y - 1, y - 1) % mod;
      }
    if (x > 1) ans = ans * y % mod;
    ans = ans * Pow(2, y - 1) % mod;
    cout << ans << endl;
  }
  return 0;
}
