def solve(N, K):
    def ways(k):
        # x+y == k
        # 1 <= x <= N
        # 1 <= y <= N
        if N >= k: return k-1
        if 2*N < k: return 0
        # k-N <= x <= N
        return N - (k-N) + 1
        
    # (b+d)(a+c) == K
    ans = 0
    for d in xrange(1, int(K**.5) + 1):
        if K%d == 0:
            ans += ways(d) * ways(K/d)
    return ans * 2

A = int(raw_input())
B = int(raw_input())

print solve(A, B)