#素因数分解
def Prime_Factorization(N):
    if N<0:
        R=[]
    else:
        R=[]

    N=abs(N)

    if N&1==0:
        C=0
        while N&1==0:
            N>>=1
            C+=1
        R.append([2,C])

    if N%3==0:
        C=0
        while N%3==0:
            N//=3
            C+=1
        R.append([3,C])

    k=5
    Flag=1
    while k*k<=N:
        if N%k==0:
            C=0
            while N%k==0:
                C+=1
                N//=k
            R.append([k,C])
        k+=2 if Flag else 4
        Flag^=1

    if N!=1:
        R.append([N,1])
    if not R:
        R.append([N,1])

    return R
#================================================
def f(i,prod):
    if i==P_len:
        return 1

    X=0
    q=prod
    p,e=P[i]
    for k in range(e+1):
        if q>M:
            break
        X+=f(i+1,q)
        q*=p
    return X
#================================================
N,K,M=map(int,input().split())

P=[[p,K*e] for p,e in Prime_Factorization(N) if p>1]
P_len=len(P)
print(f(0,1))