def divisors(n):
    ret=[]
    for i in range(1,int(n**0.5)+1):
        if n%i==0:
            ret.append(i)
            if i!=n//i:
                ret.append(n//i)
    return ret

n=int(input())
k=int(input())
divs=divisors(k)
divs=sorted(divs)
size=len(divs)
ans=0
if size%2==0:
    for i in range(size//2):
        l=divs[i]
        r=divs[-(i+1)]
        if l>n*2:
            ways1=0
        elif l<=n:
            ways1=l-1
        else:
            ways1=2*n-l+1
        if r>n*2:
            ways2=0
        elif r<=n:
            ways2=r-1
        else:
            ways2=2*n-r+1
        ans+=2*ways1*ways2
else:
    for i in range(size//2+1):
        l=divs[i]
        r=divs[-(i+1)]
        if l>n*2:
            ways1=0
        elif l<=n:
            ways1=l-1
        else:
            ways1=2*n-l+1
        if r>n*2:
            ways2=0
        elif r<=n:
            ways2=r-1
        else:
            ways2=2*n-r+1
        if i!=size//2:
            ans+=2*ways1*ways2
        else:
            ans+=ways1*ways2
print(ans)