import sys
#input = sys.stdin.readline #文字列につけてはダメ
#input = sys.stdin.buffer.readline #文字列につけてはダメ
#sys.setrecursionlimit(1000000)
#import bisect
#import itertools
#import random
#from heapq import heapify, heappop, heappush
#from collections import defaultdict 
#from collections import deque
#import copy
#import math
#from functools import lru_cache
#MOD = pow(10,9) + 7
#MOD = 998244353

def prime_factorize(n):
    ret = []
    #if n == 1:
    #    ret.append((1,1))
    #    return ret
    cnt = 0
    while n % 2 == 0:
        cnt += 1
        n //= 2
    if cnt > 0:
        ret.append((2,cnt))
    i = 3
    while i * i <= n:
        cnt = 0
        while n % i == 0:
            cnt += 1
            n //= i
        else:
            if cnt != 0: #cnt==0の時は追加しない
                ret.append((i,cnt))
            i += 2
    if n != 1:
        ret.append((n,1))
    return ret #(素因数、何乗)

def count(A,p): #A!に素因数pが何個含まれるか
    ret = 0
    while A > 0:
        ret += A//p
        A = A//p
    #print(ret)
    return ret

def main():
    N,K,M = map(int,input().split())
    L = prime_factorize(M)
    #print(L)
    LN = []
    for x,c in L:
        cnt = count(N,x) - count(K,x) - count(N-K,x)
        #print("x",x,"c",c,"cnt",cnt)
        LN.append(cnt//c)
    ans = min(LN)
    if ans < 0:
        print(0)
    else:
        print(ans)



if __name__ == '__main__':
    main()