// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------

const MOD: usize = 1_000_000_007;

fn pow_mod(mut r: usize, mut n: usize) -> usize {
    let mut t = 1;
    while n > 0 {
        if n & 1 == 1 {
            t = t * r % MOD;
        }
        r = r * r % MOD;
        n >>= 1;
    }
    t
}

fn run() {
    input!(n: usize, k: usize);
    let f = |c: usize| -> usize {
        let k = k % MOD;
        let mut nu = 1;
        let mut de = 1;
        for i in 0..c {
            nu = nu * (k + c - i + MOD) % MOD;
            de = de * (i + 1) % MOD;
        }
        nu * pow_mod(de, MOD - 2) % MOD
    };
    let mut ans = 1;
    let mut n = n;
    for i in 2.. {
        if i * i > n {
            break;
        }
        let mut cnt = 0;
        while n % i == 0 {
            n /= i;
            cnt += 1;
        }
        if cnt > 0 {
            ans = ans * f(cnt) % MOD;
        }
    }
    if n > 1 {
        ans = ans * f(1) % MOD;
    }
    println!("{}", ans);
}

fn main() {
    run();
}