#include <bits/stdc++.h>
using namespace std;
const int M = 2000005;
long long mod = 1e9 + 7;
long long a[M], per[M];
void fun() {
  a[1] = 1;
  for (int i = 2; i < M; i++) a[i] = 1ll * i * a[i - 1] % mod;
}
long long po_w(long long a, long long b) {
  long long ans = 1;
  a %= mod;
  while (b) {
    if (b & 1) ans = ans * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return ans;
}
long long C(long long m, long long n) {
  long long ans = a[n] * po_w(a[m], mod - 2) % mod;
  ans = ans * po_w(a[n - m], mod - 2) % mod;
  return ans;
}
int main() {
  int t, x, y;
  fun();
  scanf("%d", &t);
  while (t--) {
    scanf("%d %d", &x, &y);
    if (y == 1) {
      printf("1\n");
      continue;
    }
    int k = x, p = 0;
    for (int i = 2; i * i <= k; i++) {
      int sum = 0;
      while (k % i == 0) {
        sum++;
        k /= i;
      }
      if (sum != 0) per[p++] = sum;
    }
    if (k != 1) per[p++] = 1;
    long long ans = 1;
    for (int i = 0; i < p; i++) {
      ans = ans * C(per[i], per[i] + y - 1) % mod;
    }
    printf("%lld\n", ans * po_w(2, y - 1) % mod);
  }
  return 0;
}
