mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.readline

    def PrimeDecomposition(N):
        ret = {}
        n = int(N ** 0.5)
        for d in range(2, n + 1):
            while N % d == 0:
                if d not in ret:
                    ret[d] = 1
                else:
                    ret[d] += 1
                N //= d
            if N == 1:
                break
        if N != 1:
            ret[N] = 1
        return ret

    N, K = map(int, input().split())

    upper = [1] * 51
    lower = [1] * 51
    for i in range(50):
        upper[i+1] = (upper[i] * (K + i + 1))%mod
        lower[i+1] = (lower[i] * (i + 1))%mod

    P = PrimeDecomposition(N)
    ans = 1
    for p in P:
        x = P[p]
        ans = (ans * upper[x] * pow(lower[x], mod-2, mod))%mod
    print(ans)


if __name__ == '__main__':
    main()