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.
# change vala problem 1256A

# t = int(input())
# for i in range(t):
#     a, b, n, s = map(int, input().split())
#     for x in range(0,a+1):
#         for y in range(0, b+1):
#             if x*n + y == s:
#                 print("YES")
#                 break
#     if x == a and y == b:
#         print("NO")     
                
# multiplication table 577A

n, x = map(int, input().split())
# given_list = []
count = 0
for i in range(n+1):
    for j in range(n+1):
        # given_list.append(i*j)
        if i*j == x:
            
            count += 1
    
print(count)