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.
def main():
    divisors = []
    take = input().split()
    n = int(take[0])
    x = int(take[1])
    current = 1
    while current != n + 1:
        if x % current == 0:
            if x // current <= n:
                divisors.append(current)
        current += 1
    print(len(divisors))
main()

