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.
import sys

def factors(n):
    factors_list = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            factors_list.append(i)
            if i != n // i:
                factors_list.append(n // i)
    return factors_list

n, x = map(int, input().split())

ref = sorted(factors(x))
c=0
for i in range(len(ref)//2):
    if len(ref)%2!=0 and i==len(ref)-1:
        if ref[i] <=n:
            c+=1
    else:
        if ref[i]<=c and ref[len(ref)-1-i]<=c:
            c+=1