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.
"""
A. Multiplication Table: implementation, number theory

time limit per test: 1 second
memory limit per test: 256 megabytes
input: standard input
output: standard output

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.

Input
The single line contains numbers n and x (1 ≤ n ≤ 10^5, 1 ≤ x ≤ 10^9) — the size of the table and the number that we are looking for in the table.

Output
Print a single number: the number of times x occurs in the table.
"""

def multiplication_table():
    n, x = map(int, input().split(' '))
    a = 0
    # c = 0
    for i in range(1, n + 1):
        for j in range(1, n + 1):
            # c = i * j
            if i * j == x:
                a += 1
    print(a)

if __name__ == '__main__':
    multiplication_table()