#include <stdio.h>

const int Mod = 1000000007;

long long div_mod(long long x, long long y, long long z)
{
	if (x % y == 0) return x / y;
	else return (div_mod((1 + x / y) * y - x, (z % y), y) * z + x) / y;
}

long long combination(long long n, int k)
{
	if (n <= 1 || k == 0) return 1;
	
	long long i, x, y;
	for (i = n, x = 1; i >= n - k + 1; i--) x = x * (i % Mod) % Mod;
	for (i = 2, y = 1; i <= k; i++) y = y * i % Mod;
	return div_mod(x, y, Mod);
}

int main()
{
	long long N, K;
	scanf("%lld %lld", &N, &K);
	
	int i, j, k = 0, m[100] = {};
	long long p;
	for (p = 2; p * p <= N; p++) {
		if (N % p != 0) continue;
		while (N % p == 0) {
			m[k]++;
			N /= p;
		}
		k++;
	}
	if (N >= 2) m[k++] = 1;
	
	long long ans = 1;
	for (i = 0; i < k; i++) ans = ans * combination(K + m[i], m[i]) % Mod;
	printf("%lld\n", ans);
	fflush(stdout);
	return 0;
}