import java.util.*;

public class Main {
  static HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
  static ArrayList<Integer> list = new ArrayList<Integer>();
  static int ans = 0;
  static int k = 0;
  static long M = 0;
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    k = sc.nextInt();
    M = sc.nextLong();
    func(n);
    Collections.sort(list);
    dfs(-1, 1);
    System.out.println(ans);
  }

  public static void func(int n) {
    int a = 1;
    for(int i = 2; i * i <= n; i++) {
      if((n % i) == 0) {
        if(list.contains(i)) {
          map.put(i, map.get(i) + 1);
        } else {
          list.add(i);
          map.put(i, 1);
        }
        a = i;
        break;
      }
    }
    if(a > 1) func(n / a);
  }

  public static void dfs(int n, long m) {
    if(n == list.size() - 1) {
      ans++;
    } else {
      for(int i = 0; i <= map.get(list.get(n + 1)) * k; i++) {
        long t = (long)Math.pow(list.get(n + 1), i);
        if(m * t <= M) dfs(n + 1, m * t);
      }
    }
  }
}