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.
def check_bit(number,bit_index):
    return number | (1<<bit_index-1)==number

def update_bit(number,i,is_bit=True):
    value = 1 if is_bit else 0
    mask = ~(1<<i)
    return (number & mask) | (value<<i)

def main():
    n,m = map(int,input().split())
    count =0
    for i in range(1,n+1):    
        if i*n>=m and m%i==0:
            count+=1
    print(count)

if __name__=="__main__":
    main()