#include <bits/stdc++.h>
using namespace std;
const int N = 1005, M = 105;
const long long MO = 1e9 + 7;
int n, m, z, x, y, pr[N], num, su[N], sn, a[N];
long long pw2[10000005], ans;
bool c[N];
void prime() {
  for (int i = 2; i <= 1000; ++i)
    if (!c[i]) {
      pr[++num] = i;
      for (int j = i + i; j <= 1000; j += i) c[j] = true;
    }
}
long long PowMod(long long t, long long y, long long z) {
  long long r = 1;
  for (; y; y >>= 1, t = t * t % z)
    if (y & 1) r = r * t % z;
  return r;
}
long long C(int x, int y) {
  long long ans = 1;
  for (int j = x - y + 1; j <= x; ++j) ans = ans * j % MO;
  for (int j = 2; j <= y; ++j) ans = ans * PowMod(j, MO - 2, MO) % MO;
  return ans;
}
void work() {
  scanf("%d%d", &x, &y);
  ans = pw2[y - 1];
  for (int i = 1; i <= num; ++i)
    if (x % pr[i] == 0) {
      z = 0;
      while (x % pr[i] == 0) ++z, x /= pr[i];
      ans = ans * C(z + y - 1, z) % MO;
    }
  if (x > 1) ans = ans * y % MO;
  printf("%I64d\n", ans);
}
int main() {
  prime();
  pw2[0] = 1;
  for (int i = 1; i <= 1000000; ++i) pw2[i] = pw2[i - 1] * 2 % MO;
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) work();
}
