#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
const int mod = 1e9 + 7;
int dp[N][20];
int mul(int a, int b) { return (1LL * a * b) % mod; }
int add(int a, int b) { return (a + b) % mod; }
vector<int> factorize(int n) {
  vector<int> ret;
  for (int i = 2; i * i <= n; ++i) {
    int count = 0;
    while (n % i == 0) {
      n /= i;
      ++count;
    }
    if (count) {
      ret.push_back(count);
    }
  }
  if (n > 1) {
    ret.push_back(1);
  }
  return ret;
}
int solve(int y, int p) {
  if (!y) {
    return !p;
  }
  auto &ret = dp[y][p];
  if (~ret) {
    return ret;
  }
  ret = solve(y - 1, p);
  if (p) {
    ret = add(ret, solve(y, p - 1));
  }
  return ret;
}
int pw(int b, int p) {
  if (!p) {
    return 1;
  }
  auto res = pw(b, p >> 1);
  res = mul(res, res);
  if (p & 1) {
    res = mul(res, b);
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  memset(dp, -1, sizeof dp);
  int q;
  cin >> q;
  while (q--) {
    int x, y;
    cin >> x >> y;
    auto v = factorize(x);
    int ans = 1;
    for (auto &i : v) {
      ans = mul(ans, solve(y, i));
    }
    ans = mul(ans, pw(2, y - 1));
    cout << ans << '\n';
  }
  return 0;
}
