from collections import *
from itertools import *
from functools import *
from heapq import *
import sys,math
input = sys.stdin.readline

N,L = map(int,input().split())

ans = 0

sieve = [False]*(L+1)
sieve[1] = 1
for i in range(2,L+1):
    if sieve[i]:
        continue
    ans += max(0,L - (N-1)*i + 1)
    for j in range(i,L+1,i):
        sieve[j] = True
print(ans)