N,K=map(int,input().split())
M=10**5
if M>=K:
  DP=[[0]*K for i in range(N+1)]
  DP[0][0]=1
  for i in range(N):
    for j in range(K):
      DP[i+1][j]+=DP[i][j]
    for j in range(K):
      x=(j+1)*(i+1)
      if x<=K:
        DP[i+1][x-1]+=DP[i][j]
  print(sum(DP[N])-1)
  exit()
DP1=[[0]*M for i in range(N+1)]
Z=K//M
DP2=[[0]*Z for i in range(N+1)]
DP1[0][0]=1
for i in range(N):
  for j in range(M):
    DP1[i+1][j]+=DP1[i][j]
    x=(j+1)*(i+1)
    if x>K:
      continue
    elif x<=M:
      DP1[i+1][x-1]+=DP1[i][j]
    else:
      DP2[i+1][K//x-1]+=DP1[i][j]
  for j in range(Z):
    DP2[i+1][j]+=DP2[i][j]
    x=(j+1)//(i+1)
    if x>0:
      DP2[i+1][x-1]+=DP2[i][j]
print(sum(DP1[N])+sum(DP2[N])-1)