#include <bits/stdc++.h>
const int N = 2e6;
const int p = 1e9 + 7;
using namespace std;
int T, x, y, fac[N + 5], inv[N + 5], ans;
int mypow(int a, int x) {
  int s = 1;
  for (; x; x& 1 ? s = 1ll * s * a % p : 0, a = 1ll * a * a % p, x >>= 1)
    ;
  return s;
}
int C(int n, int m) { return 1ll * fac[n] * inv[n - m] % p * inv[m] % p; }
int main() {
  scanf("%d", &T);
  fac[0] = 1;
  for (int i = 1; i <= N; i++) fac[i] = 1ll * fac[i - 1] * i % p;
  inv[1] = 1;
  for (int i = 2; i <= N; i++) inv[i] = 1ll * (p - p / i) * inv[p % i] % p;
  inv[0] = 1;
  for (int i = 1; i <= N; i++) inv[i] = 1ll * inv[i - 1] * inv[i] % p;
  while (T--) {
    scanf("%d%d", &x, &y);
    ans = mypow(2, y - 1);
    int xx = x;
    for (int i = 2; i * i <= xx; i++)
      if (xx % i == 0) {
        int cnt = 0;
        while (xx % i == 0) {
          xx /= i;
          cnt++;
        }
        ans = 1ll * ans * C(cnt + y - 1, y - 1) % p;
      }
    if (xx != 1) ans = 1ll * ans * y % p;
    printf("%d\n", ans);
  }
  return 0;
}
