#include<stdio.h>
#include<stdlib.h>
#include<stdint.h>
#include<inttypes.h>
#include<string.h>
#include<math.h>

typedef int32_t i32;
typedef int64_t i64;

#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define ABS(a) ((a)>(0)?(a):-(a))
#define ALLOC(size,type) ((type*)calloc((size),sizeof(type)))
#define SORT(a,num,cmp) qsort((a),(num),sizeof(*(a)),cmp)

i32 calc (i64 n, i64 m, i64 *p, i64 *a, i32 len) {
  if (n > m) return 0;
  i32 ans = 1;
  for (i32 i = 0; i < len; ++i) {
    i64 t = n * p[i];
    i64 j = 1;
    while (t <= m && j <= a[i]) {
      ans += calc (t, m, p + i + 1, a + i + 1, len - i - 1);
      t *= p[i];
      j++;
    }
  }
  return ans;
}

void run (void) {
  i64 n, k, m;  
  scanf ("%" SCNi64 "%" SCNi64 "%" SCNi64, &n, &k, &m);
  i64 p[32], a[32];
  i32 len = 0;
  for (i32 i = 2; i * i <= n; ++i) {
    if (n % i != 0) continue;
    p[len] = i;
    a[len] = 0;
    while (n % i == 0) {
      a[len]++;
      n /= i;
    }
    len++;
  }
  if (n > 1) {
    p[len] = n;
    a[len++] = 1;
  }
  for (i32 i = 0; i < len; ++i) {
    a[i] *= k;
  }
  i32 ans = calc (1, m, p, a, len);
  printf ("%" PRIi32 "\n", ans);
}

int main (void) {
  run();
  return 0;
}