#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;

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

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007; // 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
/*-------------------------------------------------*/
vector<pair<long long, long long> > prime_factorization(long long val) {
  vector<pair<long long, long long> > res;
  for (long long i = 2; i * i <= val; ++i) {
    if (val % i != 0) continue;
    int exponent = 0;
    while (val % i == 0) {
      ++exponent;
      val /= i;
    }
    res.emplace_back(i, exponent);
  }
  if (val != 1) res.emplace_back(val, 1);
  return res;
}

int main() {
  cin.tie(0); ios::sync_with_stdio(false);
  // freopen("input.txt", "r", stdin);

  int n, k, m; cin >> n >> k >> m;
  if (n == 1) {
    cout << 1 << '\n';
    return 0;
  }
  auto prime = prime_factorization(n);
  int sz = prime.size();
  REP(i, sz) prime[i].second *= k;
  for (int i = sz - 1; i >= 0; --i) {
    long long tmp = 1;
    int expo = 0;
    while (tmp * prime[i].first <= m) {
      tmp *= prime[i].first;
      ++expo;
      if (expo == prime[i].second) break;
    }
    if (expo == 0) prime.pop_back();
    else prime[i].second = expo;
  }
  set<int> ans;
  sz = prime.size();
  function<void(int, int)> dfs = [&](int idx, int now) {
    if (idx == sz) return;
    REP(i, prime[idx].second + 1) {
      if (now > m) return;
      ans.emplace(now);
      dfs(idx + 1, now);
      now *= prime[idx].first;
    }
  };
  dfs(0, 1);
  cout << ans.size() << '\n';
  return 0;
}