use std::cmp::{max, min};

fn gcd(a: usize, b: usize) -> usize {
    if a % b == 0 { return b; }
    gcd(b, a % b)
}

fn main() {
    let mut abn = String::new();
    std::io::stdin().read_line(&mut abn).ok();
    let abn: Vec<usize> = abn.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();   
    let a = abn[0];
    let b = abn[1];
    let n = abn[2];
    const DIVISOR: usize = 1e9 as usize + 7;
    let mut cands: Vec<usize> = (max(2, a)..=b).collect();
    for _ in 0..n-1 {
        cands = cands.iter()
            .map(|&i| (max(2, a)..=b).map(|j| gcd(max(i, j), min(i, j))).filter(|&j| j > 1).collect::<Vec<usize>>())
            .flatten()
            .collect();
    }
    println!("{}", cands.iter().fold(1, |acc, x| acc * x % DIVISOR));
}