import java.util.*;

public class Main {
	public static void main (String[] args) {
    	Scanner sc = new Scanner(System.in);
    	int n = sc.nextInt();
    	int k = sc.nextInt();
    	int m = sc.nextInt();
    	TreeMap<Integer, Integer> primes = new TreeMap<>();
    	for (int i = 2; i <= Math.sqrt(n); i++) {
    	    while (n % i == 0) {
    	        if (primes.containsKey(i)) {
    	            primes.put(i, primes.get(i) + 1);
    	        } else {
    	            primes.put(i, 1);
    	        }
    	        n /= i;
    	    }
    	}
    	if (n > 1) {
    	    if (primes.containsKey(n)) {
    	        primes.put(n, primes.get(n) + 1);
    	    } else {
    	        primes.put(n, 1);
    	    }
    	}
    	TreeSet<Integer> results = new TreeSet<>();
    	results.add(1);
    	for (int x : primes.keySet()) {
    	    Integer tmp = Integer.MAX_VALUE;
    	    while ((tmp = results.lower(tmp)) != null) {
    	        long base = tmp.intValue();
    	        for (long i = 1; i <= (long)k * primes.get(x); i++) {
    	            base *= x;
    	            if (base > m) {
    	                break;
    	            }
    	            results.add((int)base);
    	        }
    	    }
    	}
    	System.out.println(results.size());
    }
}