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.
# -*- coding: utf-8 -*-
"""
Created on Fri Jan 13 11:45:04 2023

@author: Lenovo
"""

n,x=map(int,input().split())
soma = 0
if x>n:
    for i in range(2,x//2+1):
        if x%i==0 and x//i<=n:
            soma+=1
        if i>n:
            break

else:
    for i in range(1,n+1):
        if x%i==0 and x//i<=n:
            soma+=1
        if i>x:
            break
print(soma)
        