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() -> int:
    n, x = tuple(int(x) for x in input().split())
    result = 0
    end_limit = n + 1 if x > n else x + 1
    start_lim = 1 if x < n else x // n
    for i in range(start_lim, end_limit):
        for k in range(i, end_limit):
            if i * k == x:
                result += 1 if i == k else 2
    return result

if __name__ == '__main__':
    print(main())