#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <tuple>

using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int64_t N, K, M;
vector<pair<int64_t, int64_t>> factors;
set<int64_t> cand;

vector<pair<int64_t, int64_t>> f(int64_t n) {
  vector<pair<int64_t, int64_t>> ret;
  for (int64_t i = 2; i * i <= n; i++) {
    int cnt = 0;
    while (n % i == 0) {
      n /= i;
      cnt += 1;
    }
    if (cnt > 0) {
      ret.emplace_back(i, cnt);
    }
  }
  if (n > 1) {
    ret.emplace_back(n, 1);
  }
  return ret;
}

void dfs(int i, int64_t val) {
  if (val > M) return;
  cand.insert(val);
  if (i >= factors.size()) return;
  int64_t p = 1;
  int64_t v, cnt;
  tie(v, cnt) = factors[i];
  dfs(i + 1, val);
  rep(j, cnt) {
    if (val * p * v > M) break;
    dfs(i + 1, val * p * v);
    p *= v;
    if (p * v > M) break;
  }
}

int main() {
  
  cin >> N >> K >> M;

  factors = f(N);
  for (auto &p: factors) {
    p.second *= K;
  }
  dfs(0, 1);
  cout << cand.size() << endl;

  return 0;
}