#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7, N = 2000005;
long long t, x, y, two[N], fac[N], arr[50];
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
inline long long ksm(long long n, long long m) {
  long long gg = 1ll;
  while (m) {
    if (m & 1) (gg *= n) %= mod;
    (n *= n) %= mod;
    m >>= 1;
  }
  return gg % mod;
}
inline long long C(long long n, long long m) {
  return (fac[n] * ksm(fac[m] * fac[n - m] % mod, mod - 2)) % mod;
}
int main() {
  fac[0] = two[0] = 1;
  for (int i = 1; i < N; i++)
    fac[i] = fac[i - 1] * i % mod, two[i] = two[i - 1] * 2 % mod;
  t = read();
  while (t--) {
    memset(arr, 0, sizeof(arr));
    long long tot = 0, ans = 1;
    x = read();
    y = read();
    for (int i = 2; i * i <= x; i++)
      if (!(x % i)) {
        tot++;
        while (!(x % i)) x /= i, arr[tot]++;
      }
    if (x != 1) arr[++tot] = 1;
    for (int i = 1; i <= tot; i++) (ans *= C(y + arr[i] - 1, arr[i])) %= mod;
    (ans *= two[y - 1]) %= mod;
    cout << ans << endl;
  }
}
