using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
class Program
{
    static int NN => int.Parse(ReadLine());
    static long[] NList => ReadLine().Split().Select(long.Parse).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, k) = (c[0], c[1]);
        WriteLine(Good(n, k));
    }
    static long Good(long n, long k)
    {
        var mod = 1_000_000_007;
        var p = PDiv(n);
        while (p.Count != (p.ContainsKey(2) ? 1 : 0) + (p.ContainsKey(3) ? 1 : 0))
        {
            var np = new Dictionary<long, long>();
            foreach (var kv in p)
            {
                var nkey = PDiv(kv.Key + 1);
                foreach (var nkv in nkey)
                {
                    if (np.ContainsKey(nkv.Key)) np[nkv.Key] += kv.Value * nkv.Value;
                    else np[nkv.Key] = kv.Value * nkv.Value;
                }
            }
            --k;
            p = np;
            if (k == 0)
            {
                var ans2 = 1L;
                foreach (var kv in p) for (var i = 0; i < kv.Value; ++i) ans2 = ans2 * kv.Key % mod;
                return ans2;
            }
        }
        var m = new Matrix(mod - 1);
        var a = new long[][] { new long[] { p.ContainsKey(2) ? p[2] : 0, p.ContainsKey(3) ? p[3] : 0 }};
        var x = new long[][] { new long[] { 0, 1 }, new long[] { 2, 0 }};
        var b = m.Mul(a, m.Pow(x, k));
        return Exp(2, b[0][0], mod) * Exp(3, b[0][1], mod) % mod;
    }
    static long Exp(long n, long k, int mod)
    {
        if (k == 0) return 1;
        if (k == 1) return n % mod;
        var half = Exp(n, k / 2, mod);
        var result = (half * half) % mod;
        return ((k % 2) == 0) ? result : ((result * n) % mod);
    }
    static Dictionary<long, long> PDiv(long n)
    {
        var dic = new Dictionary<long, long>();
        var tmp = n;
        while (tmp % 2 == 0)
        {
            tmp /= 2;
            if (dic.ContainsKey(2)) ++dic[2];
            else dic.Add(2, 1);
        }
        for (var p = 3L; p * p <= n; p += 2)
        {
            while (tmp % p == 0)
            {
                tmp /= p;
                if (dic.ContainsKey(p)) ++dic[p];
                else dic.Add(p, 1);
            }
            if (tmp == 1) break;
        }
        if (tmp > 1) dic.Add(tmp, 1);
        return dic;
    }
    class Matrix
    {
        int mod;
        // 行列の累乗
        public Matrix(int _mod = 1_000_000_007)
        {
            mod = _mod;
        }
        public long[][] Pow(long[][] m, long k)
        {
            var multi = m;
            var r = new long[m.Length][];
            for (var i = 0; i < m.Length; ++i)
            {
                r[i] = new long[m.Length];
                r[i][i] = 1;
            }
            while (k > 0)
            {
                if ((k & 1) == 1) r = Mul(r, multi);
                multi = Mul(multi, multi);
                k >>= 1;
            }
            return r;
        }
        // 行列の積
        public long[][] Mul(long[][] x, long[][] y)
        {
            var r = new long[x.Length][];
            for (var i = 0; i < x.Length; ++i) r[i] = new long[y[0].Length];
            for (var i = 0; i < x.Length; ++i) for (var k = 0; k < x[0].Length; ++k)
            {
                for (var j = 0; j < y[0].Length; ++j) r[i][j] = (r[i][j] + x[i][k] * y[k][j]) % mod;
            }
            return r;
        }
    }
}