#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

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

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

#[allow(unused_macros)]
macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, bytes) => {
        read_value!($next, String).into_bytes()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}
mod vig {
    pub fn prime_factor(mut n: u64, k:u64, m:u64) -> Vec<(u64, u64)> {
        let mut ans: Vec<(u64,u64)> = vec![];
        for i in 2..((n as f64).sqrt() as u64 + 2) {
            if n%i==0 {
                let div = i;
                let mut exp = 0;
                if div > m {
                    continue;
                }
                loop {
                    if n%i!=0 {
                        break;
                    }
                    n /=div;
                    exp+=1;
                }
                
                ans.push((div, exp*k));
            }
        }
        if n>1  && n <=m {
            ans.push((n, k));
        }
        ans
    }

    pub fn dfs(p: &Vec<(u64, u64)>, index: usize, now: u64, m: u64) -> u64 {
        let mut res = 0;
        if index==p.len() {
            return 1;
        }
        let (div, exp) = p[index];
        let mut n_now = now;
        for i in 0..exp+1 {
            res+=dfs(&p, index+1, n_now, m);
            n_now*=div;
            if n_now > m {
                break;
            }
        }
        res
    }
}
fn main() {
    input!{
        in_n:u64,
        in_k:u64,
        m:u64,
    }
    let mut n = in_n;
    let k = if in_k>30 {30}else{in_k};
    let mut p = vig::prime_factor(n, k, m);
    let ans = vig::dfs(&p, 0, 1, m);
    println!("{}", ans);
}