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.
a, b = map(int, input().split())

def count_divisors(n):
    if n == 1:
        return 1
    divisors = 2  # Start with 1 and n as divisors
    limit = int(n ** 0.5) + 1
    for i in range(2, limit):
        if n % i == 0:
            if i == (n // i):  # If both divisors are the same (perfect square)
                divisors += 1
            else:
                divisors += 2
    return divisors

if b < a:
    print(2)
elif b == 1:
    print(1)
else:
    div_count = count_divisors(b)
    if div_count == 2:
        print(0)
    else:
        print(div_count - 2)
