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, stdout
input, print = stdin.readline, stdout.write


def main():
    n, k = map(int, input().split())
    i = 1
    ans = 0
    while i*i <= k:
        if i > n:
            break
        if k % i == 0:
            if i*i == k:
                ans += 1
            elif k/i <= n:
                ans += 2
        i += 1
    print(str(ans)+"\n")


if __name__ == "__main__":
    main()
