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.
x = list(map(int, input().split()))
if x[1] == 1: 
    print(1)
else :
    factors = 0
    i = 1
    while i <=x[1] and i < x[0]: 
        if (x[1]) % i == 0 and (x[1]) // i <x[0]:
            factors += 1
        i += 1
    print(factors)