#include <bits/stdc++.h>
using namespace std;
#define int long long
int mod = 1e9 + 7;
int jie[200005], inv[200005];

int qpow(int a, int b) {
	int ans = 1;
	while (b) {
		if (b % 2 == 1)
			ans = ans * a % mod;
		a = a * a % mod;
		b /= 2;
	}
	return ans % mod;
}

int c(int n, int m) {
    if (n < m)
        return 0;
	return jie[n] * inv[m] % mod * inv[n - m] % mod;
}
map<int, int>q;

signed main() {
	jie[0] = 1;
	inv[0] = qpow(jie[0], mod - 2);
	for (int i = 1; i <= 200000; i++) {
		jie[i] = jie[i - 1] * i % mod;
		inv[i] = qpow(jie[i], mod - 2);
	}
	int n, m;
	cin >> n >> m;
	if (n < 0)
	    n *= -1;
	for (int i = 2; i * i <= n; i++) {
		while (n % i == 0) {
			q[i]++;
			n /= i;
		}
	}
	if (n > 1)
		q[n]++;
	int ans = 1;
	for (auto x : q) {
		int y = x.second;
		ans = ans * c(y + m - 1, y) % mod;
	}
	cout << ans * qpow(2, m - 1) % mod;
}

服了一直 $WA$ $on$ $1$。