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.
# https://codeforces.com/problemset/problem/577/A

# Фактически, надо найти количество делителей числа, не привышающих n

n, x = map(int, input().split())

s = set()
for k in range(max(1, x // n), int(x ** 0.5) + 2):
    if x % k == 0 and k <= n:
        s.add(k)
        # похоже, что ненужная перестраховка
        if x // k <= n:
            s.add(x // k)
print(len(s))