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 cheng(a, b):
    d = 0
    s = [[0] * (a) for _ in range(a)]
    for i in range(0, a):  # 创建一个行的列表（行）
        for j in range(0, a):  # 循环每一行的每一个元素（列）
            if i == 0:
                s[i][j] = j + 1
            elif j == 0:
                s[i][j] = i + 1
            else:
                s[i][j] = (i + 1) * (j + 1)
    for i in range(0, a):
        for j in range(0, a):
            if b == s[i][j]:
                d = d + 1
    return print(d)


m, n = map(int, input().split(' '))
cheng(m, n)
