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
input = sys.stdin.readline

def main() -> None :
    TABLE_WIDTH, SEARCH_NUM = map(int, input().split())

    numCount:int = 0
    for dividNum in range(1, TABLE_WIDTH+1) :
        if SEARCH_NUM%dividNum==0 and SEARCH_NUM//dividNum<=TABLE_WIDTH :
            numCount += 1

    print(numCount)

main()