def trial_division(n):
    a = []  
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2   
    if n != 1: a.append(n)
    return a

N = int(input())
K = int(input())

T = trial_division(K)
D = {0:1}
ans = 0

for bit in range(1 << len(T)) :
    A = 1
    B = 1
    for k in range(len(T)) :
        if bit & (1 << k) :
            A *= T[k]
        else :
            B *= T[k]
    if A in D : continue
    D[A] = 1
    cnt1 = 0
    cnt2 = 0

    if A <= N :
        cnt1 = A-1
    elif N < A <= 2*N :
        cnt1 = N-(A-N)+1
    else :
        cnt1 = 0
    
    if B <= N :
        cnt2 = B-1
    elif N < B <= 2*N :
        cnt2 = N-(B-N)+1
    else :
        cnt2 = 0
    #print(A,B,cnt1,cnt2)
    ans += (cnt1*cnt2)
    
print(ans)