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.
# 577A
''' Author : Kunj Gandhi '''

'''Functions'''
num_inp=lambda: int(input())
arr_inp=lambda: list(map(int,input().split()))
sp_inp=lambda: map(int,input().split())
str_inp=lambda:input()

'''Code'''
n,x = sp_inp()
d = {}
for i in range(1,n+1):
    for j in range(1,n+1):
        if(i*j not in d):        
            d[i*j]=1
        else:
            d[i*j]+=1
if(x in d): print(d[x])
else: print(0)