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 math
def get():
    return list(map(int, input().split()))
def intput():
    return int(input())
def bfs(x,n):
         if (x[n]!=0):
             bfs(x,x[n])
             print(n, end=' ')
def main():
          n=get()
          p=0
          for i in range(1,n[0]+1):
              if (n[1]%i==0 and n[1]/i <=n[0]):
                    p+=1
          print(p)
main()