import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class Main {
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int k = sc.nextInt();
		int m = sc.nextInt();
		sc.close();

		if (n == 1) {
			System.out.println(1);
			return;
		}

		Map<Integer, Long> soinsu = bunkai(n);
		Integer[] keys = soinsu.keySet().toArray(new Integer[0]);
		Long[] vals = soinsu.values().toArray(new Long[0]);
		for (int i = 0; i < vals.length; i++) {
			vals[i] *= k;
		}

		Set<Long> set = new HashSet<Long>();
		set.add(1L);
		for (int i = 0; i < keys.length; i++) {
			Long[] o = set.toArray(new Long[0]);
			for (int j = 0; j < o.length; j++) {
				long x = m / o[j];
				long y = 1;
				for (int j2 = 0; j2 < vals[i]; j2++) {
					y *= keys[i];
					if (y <= x) {
						set.add(y * o[j]);
					} else {
						break;
					}
				}
			}
		}
		System.out.println(set.size());
	}

	static Map<Integer, Long> bunkai(int n) {
		Map<Integer, Long> soinsu = new HashMap<Integer, Long>();
		int end = (int) Math.sqrt(n);
		int d = 2;
		while (n > 1) {
			if (n % d == 0) {
				n /= d;
				if (soinsu.containsKey(d)) {
					soinsu.put(d, soinsu.get(d) + 1);
				} else {
					soinsu.put(d, 1L);
				}
				end = (int) Math.sqrt(n);
			} else {
				if (d > end) {
					d = n - 1;
				}
				d++;
			}
		}
		return soinsu;
	}
}