#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#include <bits/stdc++.h>
using namespace std;
using i32 = int32_t;  using i64 = int64_t;  using str = string;
using u32 = uint32_t; using u64 = uint64_t; using usize = size_t;
using f64 = double_t; template <typename T> using vec = vector<T>;
#define times(n, i) for (i64 i = 0; i < (n); ++i)
#define range(n, m, i) for (i64 i = (n); i < (m); ++i)
#define upto(n, m, i) for (i64 i = (n); i <= (m); ++i)
#define downto(n, m, i) for (i64 i = (n); i >= (m); --i)
#define foreach(xs, x) for (auto &x : (xs))
#define all(xs) (xs).begin(), (xs).end()
#define sortall(xs) sort(all(xs))
#define reverseall(xs) reverse(all(xs))
#define uniqueall(xs) (xs).erase(unique(all(xs)), (xs).end())
#define maximum(xs) (*max_element(all(xs)))
#define minimum(xs) (*min_element(all(xs)))
#define even(x) (((x) & 1) == 0)
#define odd(x) (((x) & 1) == 1)
#define append emplace_back
const i64 MOD = 1000000007;

i32 n, l;
vec<i32> primes;

void sieve() {
    i32 v = l/(n-1)+1;
    vec<bool> num(v); times(v, i) num[i] = true;
    num[0] = false;
    num[1] = false;
    range(2, sqrt(v)+1, i) {
        if (num[i]) {
            i32 j = pow(i, 2);
            while (j < v) {
                num[j] = false;
                j += i;
            }
        }
    }
    range(2, v, i) {
        if (num[i]) {
            primes.append(i);
        }
    }
}

i32 main()
{
    cin >> n >> l;

    sieve();

    i64 ans = 0;
    times(primes.size(), i) {
        i32 p = primes[i];
        if (p*(n-1) <= l)
            ans += l - p*(n-1) + 1;
    }

    cout << ans << endl;
    return 0;
}