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.
n,x = map(int,input().split())
l = []
if x>n**2:
    print(0)
    
else:   
    for i in range (1,int(x**0.5) + 1):
        if x%i == 0:
            l.append(i)
    ls = l[:]
    # print(ls)
    # for j in ls[::-1]:
    #     ls.append(x//j)
    # print(ls)
    if len(l)==1:
        if x>n:
            print(0)
        else:
            print(2)
            
            
    else:  
    
        while((x//ls[0])>n):
            ls = ls[1:]
            print(ls)
        print(2*len(ls))