#include <bits/stdc++.h>
using namespace std;
long long int power(long long int x, long long int y) {
  long long int res = 1;
  while (y) {
    if (y & 1) res = (res * x) % 1000000007;
    y = y / 2, x = (x * x) % 1000000007;
  }
  return res % 1000000007;
}
long long int n, k;
string s;
long long int fact[2000001];
long long int inv[2000001];
long long int prime[1000001];
void factorial() {
  long long int i;
  fact[0] = 1;
  inv[0] = power(fact[0], 1000000007 - 2);
  for (i = 1; i <= 2000000; i++) {
    fact[i] = (i * fact[i - 1]) % 1000000007;
    inv[i] = power(fact[i], 1000000007 - 2);
  }
}
long long int ncr(long long int x, long long int y) {
  if (x < y) return 0;
  long long int temp = fact[x];
  temp = (temp * inv[y]) % 1000000007;
  temp = (temp * inv[x - y]) % 1000000007;
  return temp;
}
void primefactor() {
  long long int i, j;
  for (i = 1; i <= 1000000; i++) prime[i] = i;
  for (i = 2; i <= 1000000; i++) {
    if (prime[i] != i) continue;
    for (j = i; j <= 1000000; j += i) prime[j] = min(i, prime[j]);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  factorial();
  primefactor();
  long long int t;
  cin >> t;
  while (t--) {
    long long int x, y;
    cin >> x >> y;
    long long int ans = power(2, y - 1);
    while (x > 1) {
      long long int temp = prime[x];
      long long int cnt = 0;
      while (x % temp == 0) x /= temp, cnt++;
      temp = fact[y + cnt - 1];
      temp = (temp * inv[cnt]) % 1000000007;
      temp = (temp * inv[y - 1]) % 1000000007;
      ans = (ans * temp) % 1000000007;
    }
    cout << ans << "\n";
  }
}
