#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for (int i=(int)(b); i<(int)(e); i++)
#define ALL(x) (x).begin(), (x).end()

const double PI = acos(-1);

map<long long, int> factorize(long long n) {
  map<long long, int> ret;
  
  for (long long i = 2; i * i <= n; i++) {
    while (n % i == 0) {
      ++ret[i];
      n /= i;
    }
  }
  
  if (n != 1)
    ret[n] = 1;
  
  return ret;
}

int ret = 0;

void go(long long acc, long long ub, const vector<pair<long long, int> > &v, int pos) {
  if (pos >= v.size()) {
    if (acc <= ub)
      ++ret;
  } else {
    long long x;
    int y;
    tie(x, y) = v[pos];
    REP (i, y+1) {
      if (acc > ub) break;
      go(acc, ub, v, pos+1);
      acc *= x;
    }
  }
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  long long n, k, m;
  cin >> n >> k >> m;

  vector<pair<long long, int> > v;
  for (auto &pr: factorize(n)) {
    v.emplace_back(pr.first, pr.second * k);
  }

  go(1, m, v, 0);

  cout << ret << endl;
  
  return 0;
}