#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long N = 1e6 + 50;
long long prime[N];
long long fact[N];
void init() {
  fact[0] = fact[1] = 1;
  for (long long i = 2; i < N; ++i) {
    fact[i] = fact[i - 1] * i % mod;
    if (!prime[i]) {
      for (long long j = i; j < N; j += i)
        if (!prime[j]) prime[j] = i;
    }
  }
}
long long power(long long a, long long n) {
  long long res = 1;
  if (n < 0) return 0;
  while (n) {
    if (n & 1) res *= a, res %= mod;
    a *= a;
    a %= mod;
    n /= 2;
  }
  return res;
}
long long ncr(long long n, long long r) {
  long long ans = fact[n];
  long long val = fact[r] * fact[n - r] % mod;
  val = power(val, mod - 2);
  ans *= val;
  ans %= mod;
  return ans;
}
void solve() {
  long long x, y;
  cin >> x >> y;
  long long ans = 1;
  while (x > 1) {
    long long div = prime[x];
    long long cnt = 0;
    while (x % div == 0) ++cnt, x /= div;
    ans *= ncr(y + cnt - 1, y - 1);
    ans %= mod;
  }
  ans *= power(2, y - 1);
  ans %= mod;
  cout << ans << '\n';
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  long long t;
  t = 1;
  cin >> t;
  init();
  while (t--) {
    solve();
  }
}
