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 collections import Counter


def main():
    delit = []
    summ = 0
    pairs = set()

    n, x = map(int, input().split())

    for i in range(n, 0, -1):
        if x % i == 0:
            delit.append(i)
    for i in delit:
        for j in delit:
            if i*j == x:
                pairs.add(tuple((i, j)))
    delit.reverse()
    for i in delit:
        for j in delit:
            if i * j == x:
                pairs.add(tuple((i, j)))
    print(len(pairs))


if __name__ == '__main__':
    main()
