package main

import (
	"fmt"
	"sort"
)

func main() {
	var N, L int
	fmt.Scan(&N, &L)
	prime := Sieve(L)
	sort.Ints(prime)
	ans := 0
	for _, p := range prime {
		if (N-1)*p <= L {
			//fmt.Println(p, L - (N - 1) * p + 1)
			ans += L - (N - 1) * p + 1
		}
	}
	fmt.Println(ans)
}

func Sieve(n int) []int {
	isNotPrime := make([]bool, n+1)
	primeList := make([]int, 0)
	isNotPrime[0] = true
	isNotPrime[1] = true
	for i := 2; i <= n; i++ {
		if !isNotPrime[i] {
			// 素数の場合
			primeList = append(primeList, i)
			for j := 2 * i; j <= n; j += i {
				isNotPrime[j] = true
			}
		}
	}
	return primeList
}