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.
from bisect import bisect_right
from math import isqrt
def isPrime(num):
    for i in range(2, isqrt(num)+1):
        if not num%i:
            return False
    return True

def pf(num):
    s = set()
    for i in range(1, isqrt(num)+1):
        if not num%i:
            s.add(i)
            s.add(num//i)
    a = [x for x in s]
    return a

# print(pf(12))

def solve():
    n, x = map(int, input().split())
    if isPrime(x):
        if n >= x:
            print(2);return
        else:
            print(0);return
    a = pf(x)
    idx = bisect_right(a, n)
    print(n-(2*(n-idx)))


solve()
