#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 25, K = 23;
const int MOD = 1e9 + 7;
int q;
int c[K][MAXN], pw[MAXN];
bool mark[MAXN];
vector<pair<int, int> > vec[MAXN];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  pw[0] = 1;
  for (int i = 0; i < MAXN; i++) {
    c[0][i] = 1;
    if (i) pw[i] = pw[i - 1] * 2 % MOD;
  }
  for (int i = 1; i < MAXN; i++)
    for (int j = 1; j < min(K, i + 1); j++)
      c[j][i] = (c[j - 1][i - 1] + c[j][i - 1]) % MOD;
  cin >> q;
  while (q) {
    q--;
    int x, y;
    cin >> x >> y;
    long long ans = 1;
    for (int i = 2; i * i <= x; i++) {
      if (x % i) continue;
      int p = 0;
      while (x % i == 0) x /= i, p++;
      ans = (ans * c[p][y + p - 1]) % MOD;
    }
    if (x > 1) ans = (ans * y) % MOD;
    ans = (ans * pw[y - 1]) % MOD;
    cout << ans << endl;
  }
  return 0;
}
