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, io, os
import math
import bisect
import heapq
import string
from collections import defaultdict,Counter,deque
input = sys.stdin.readline
 
def I():
    return input()
 
def II():
    return int(input())
 
def MII():
    return map(int, input().split())
 
def LI():
    return list(input().split())
 
def LII():
    return list(map(int, input().split()))
 
def GMI():
    return map(lambda x: int(x) - 1, input().split())
 
def LGMI():
    return list(map(lambda x: int(x) - 1, input().split()))
 
def WRITE(out):
  return print('\n'.join(map(str, out)))
 
def WS(out):
  return print(' '.join(map(str, out)))
 
def WNS(out):
  return print(''.join(map(str, out)))

'''
10000 * 10000

1 2 3 4 5 6
2 4 6 8 10 12

2 * 6
3 * 4
4 * 3
6 * 2

1 36
2 18
4 9
6 6

so... prime factorize x and if x is not a square number
return num(prime_factors)
ensure only add prime factors where the other value is <= n
'''

def solve():
    n, x = MII()
    ans = 0
    for i in range(1, min(n,x)+1):
        if i*i > x:
            break

        if x%i == 0 and x//i <= n:
            ans += 1 if i*i == x else 2
    print(ans)

solve()