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 sys import stdin
from math import sqrt

def line(): return stdin.readline().strip()
def rd(converter): return converter(line())
def rl(converter, delimeter = None): return list(map(converter, line().split(delimeter)))
def rls(num_lines, converter): return [rd(converter) for i in range(num_lines)]
def rg(num_lines, converter, delimeter = None): return [rl(converter,delimeter) for i in range(num_lines)]

MULTIPLE_CASES = 0

def main():
    N,X = rl(int)
    print(sum((1 if num == X//num else 2) if X%num == 0 and X//num <= N else 0 for num in range(1,min(N,int(sqrt(X)))+1)))

for i in range(rd(int) if MULTIPLE_CASES else 1): main()