// yukicoder: No.847 Divisors of Power
// 2019.7.6 bal4u

#include <stdio.h>
#include <math.h>

typedef long long ll;

#define SIZE  50
int factor[SIZE], power[SIZE]; int sz;

int ptbl[] = {
		 3,   5,   7,  11,  13,  17,  19,  23,  29,
   31,  37,  41,  43,  47,  53,  59,  61,  67,  71,
   73,  79,  83,  89,  97, 101, 103, 107, 109, 113,
  127, 131, 137, 139, 149, 151, 157, 163, 167, 173,
  179, 181, 191, 193, 197, 199, 211, 223, 227, 229,
  233, 239, 241, 251, 257, 263, 269, 271, 277, 281,
  283, 293, 307, 311, 313, 317, 331, 337, 347, 349,
  353, 359, 367, 373, 379, 383, 389, 397, 401, 409,
  419, 421, 431, 433, 439, 443, 449, 457, 461, 463,
  467, 479, 487, 491, 499, 503, 509, 521, 523, 541,
  547, 557, 563, 569, 571, 577, 587, 593, 599, 601,
  607, 613, 617, 619, 631, 641, 643, 647, 653, 659,
  661, 673, 677, 683, 691, 701, 709, 719, 727, 733,
  739, 743, 751, 757, 761, 769, 773, 787, 797, 809,
  811, 821, 823, 827, 829, 839, 853, 857, 859, 863,
  877, 881, 883, 887, 907, 911, 919, 929, 937, 941,
  947, 953, 967, 971, 977, 983, 991, 997, 0 };

void prime_factor(int n) {
	int i, d;
	int *pp;

	if ((n & 1) == 0) {
		factor[sz] = 2;
		do n >>= 1, power[sz]++;
		while ((n & 1) == 0);
		sz++;
	}
	for (pp = ptbl; n > 1 && *pp > 0; pp++) {
		if (n % *pp) continue;
		d = *pp;
		factor[sz] = d;
		do n /= d, power[sz]++;
		while (n % d == 0);
		sz++;
	}
	if (n > 1) {
		int b = (int)sqrt((double)n);
		for (i = 1009; n > 1; i += 2) {
			if (i > b) {
				factor[sz] = n, power[sz++] = 1;
				break;
			}
			if (n % i == 0) {
				factor[sz] = i;
				do n /= i, power[sz]++;
				while (n % i == 0);
				sz++;
			}
		}
	}
}

int N, K, M;
int a[1000000];

int maxp(int b, int p) {
	ll a = 1, t = (ll)p*K; int f = 0;
	while (t-- && a*b <= M) a *= b, f++;
	return f;
}
	
int main()
{
	int i, j, k, n, m, 
	ans;
	ll b;
	
	scanf("%d%d%d", &N, &K, &M);
	if (N == 1 || M == 1) { puts("1"); return 0; }
	prime_factor(N);
	for (i = 0; i < sz; i++) power[i] = maxp(factor[i], power[i]);
	
	a[0] = 1, n = 1;
	for (i = 0; i < sz; i++) {
		b = 1, m = n; for (j = 0; j < power[i]; j++) {
			b *= factor[i];
			for (k = 0; k < m; k++) if (b*a[k] <= M) a[n++] = b*a[k];
		}
	}
	printf("%d\n", n);
	return 0;
}