#include <bits/stdc++.h>
using namespace std;
const long long M = 1e9 + 7;
vector<int> primes(1000001, -1);
vector<long long> facs(1e7);
long long binpow(long long x, long long p) {
  if (p == 0) return 1;
  if (p == 1) return x % M;
  return ((binpow((x * x) % M, p / 2) % M) * (p % 2 ? x : 1)) % M;
}
long long getc(long long n, long long k) {
  return (facs[n + k - 1] * binpow((facs[n - 1] * facs[k]) % M, M - 2)) % M;
}
int main() {
  ios::sync_with_stdio(false);
  primes[1] = 1;
  for (int i = 2; i <= 1e6; ++i) {
    if (primes[i] != -1) continue;
    for (int j = i; j <= 1e6; j += i) primes[j] = i;
  }
  facs[0] = 1;
  for (int i = 1; i < facs.size(); ++i) facs[i] = (facs[i - 1] * i) % M;
  int q;
  cin >> q;
  while (q--) {
    long long x, y;
    cin >> x >> y;
    long long prx = 1;
    map<long long, long long> vm;
    while (primes[x] != 1) {
      vm[primes[x]]++;
      x /= primes[x];
    }
    long long ans = 1;
    for (auto it = vm.begin(); it != vm.end(); ++it)
      ans = (ans * getc(y, it->second)) % M;
    ans = (ans * binpow(2, y - 1)) % M;
    cout << ans << endl;
  }
  return 0;
}
