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.
from math import isqrt

def main() -> int:
    n, x = tuple(int(x) for x in input().split())
    if x > n * n:
        return 0
    result = 0
    for i in range(1, isqrt(x) + 1):
        if not x % i:
            result += 2 if i * i != x else 1
    return result


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