/* -*- coding: utf-8 -*-
 *
 * 847.cc:  No.847 Divisors of Power - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_P = 31623;

/* typedef */

typedef long long ll;
typedef pair<int,int> pii;
typedef vector<pii> vpii;

/* global variables */

bool primes[MAX_P];
int pnums[MAX_P];

/* subroutines */

int gen_primes(int maxp, int pnums[]) {
  memset(primes, true, sizeof(primes));
  primes[0] = primes[1] = false;

  int p, pn = 0;
  for (p = 2; p * p <= maxp; p++)
    if (primes[p]) {
      pnums[pn++] = p;
      for (int q = p * p; q <= maxp; q += p) primes[q] = false;
    }
  for (; p <= maxp; p++)
    if (primes[p]) pnums[pn++] = p;
  return pn;
}

void prime_decomp(int n, int pn, int pnums[], vpii& pds) {
  pds.clear();

  for (int i = 0; i < pn; i++) {
    int pi = pnums[i];
    if (pi * pi > n) break;

    if (n % pi == 0) {
      int fi = 0;
      while (n % pi == 0) n /= pi, fi++;
      pds.push_back(pii(pi, fi));
    }
  }

  if (n > 1) pds.push_back(pii(n, 1));
}

int rec(int k, int m, vpii &pds) {
  if (k >= pds.size()) return 1;

  int sum = 0, p = pds[k].first, f = pds[k].second;
  for (int i = 0; m > 0 && i <= f; i++, m /= p)
    sum += rec(k + 1, m, pds);
  return sum;
}

/* main */

int main() {
  int pn = gen_primes(MAX_P, pnums);
  //printf("pn=%d\n", pn);

  int n, k, m;
  scanf("%d%d%d", &n, &k, &m);

  vpii pds;
  prime_decomp(n, pn, pnums, pds);

  for (vpii::iterator vit = pds.begin(); vit != pds.end(); vit++) {
    ll d = (ll)vit->second * k;
    vit->second = min(d, 29LL);
  }

  //for (vpii::iterator vit = pds.begin(); vit != pds.end(); vit++) {
  //if (vit != pds.begin()) putchar('+');
  //printf("%d^%d", vit->first, vit->second);
  //}
  //putchar('\n');

  printf("%d\n", rec(0, m, pds));
  return 0;
}