#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;
// const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in: v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e: t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

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

int main() {
  int64 N, K, M;
  cin >> N >> K >> M;
  auto P = prime_factor(M);
  int64 ret = infll;
  for(auto&[base, fact]: P) {
    __int128_t prod = base;
    vector< __int128_t > sz1;
    while(prod <= N) {
      sz1.emplace_back(N / prod - (N - K) / prod);
      prod *= base;
    }
    for(int k = (int) sz1.size() - 2; k >= 0; k--) {
      for(int l = k + 1; l < sz1.size(); l++) {
        sz1[k] -= sz1[l];
      }
    }
    vector< __int128_t > sz2;
    prod = base;
    while(prod <= K) {
      sz2.emplace_back(K / prod);
      prod *= base;
    }
    for(int k = (int) sz2.size() - 2; k >= 0; k--) {
      for(int l = k + 1; l < sz2.size(); l++) {
        sz2[k] -= sz2[l];
      }
    }
    int d = max(sz1.size(), sz2.size());
    sz1.resize(d);
    sz2.resize(d);
    //2^3*2^1
    __int128_t add = 0;
    for(int i = 0; i < sz1.size(); i++) {
      add += (sz1[i] - sz2[i]) * (i + 1);
    }
    chmin(ret, add);
  }
  cout << ret << "\n";
}