Let's consider a table consisting of *n* rows and *n* columns. The cell located at the intersection of *i*-th row and *j*-th column contains number *i* × *j*. The rows and columns are numbered starting from 1.

You are given a positive integer *x*. Your task is to count the number of cells in a table that contain number *x*.
The single line contains numbers *n* and *x* (1 ≤ *n* ≤ 10<sup class="upper-index">5</sup>, 1 ≤ *x* ≤ 10<sup class="upper-index">9</sup>) — the size of the table and the number that we are looking for in the table.
n, x = map(int, input().split())

def is_prime(n):
    if n <= 1:
        return False
    elif n <= 3:
        return True
    elif n % 2 == 0 or n % 3 == 0:
        return False
    i = 5
    while i * i <= n:
        if n % i == 0 or n % (i + 2) == 0:
            return False
        i += 6
    return True


if int(x ** 0.5) == x ** 0.5:
    print(1)
elif is_prime(x):
    if x <= n:
        print(2)
    else:
        print(0)
else:
    if x > n**2:
        print(0)
    else:
        if x == 4:
            print(3)
        elif x == n or n*2 == x:
            print(4)
        else:
            c = 0
            for i in range(2,n+1):
                if x%i == 0 and x / i <= n:
                    c = 1
            if c == 0:
                print(0)
            else:
                print(2)