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"""
rows, num = [int(x) for x in input().split()]
table = []
times = 0
for _ in range(rows):
    table.append([0] * rows)

for row in range(rows):
    for column in range(rows):
        table[row][column] = (row + 1) * (column + 1)
        if table[row][column] == num:
            times += 1

print(times)
