#include <iostream>
#include <vector>
using namespace std;

const int MAX_NUM = 20000000;
bool prime_table[MAX_NUM];
typedef long long ll;

vector<int> sieve() {
    vector<int> primes;
    fill(prime_table, prime_table + MAX_NUM, true);

    prime_table[0] = prime_table[1] = false;
    for (auto n = 2; n * n < MAX_NUM; n++) {
        if (prime_table[n]) {
            for (auto i = 2; i * n < MAX_NUM; i++) {
                prime_table[i * n] = false;
            }
        }
    }
    for (auto n = 2; n < MAX_NUM; n++) {
        if (prime_table[n]) {
            primes.push_back(n);
        }
    }
    return primes;
}

int main() {
    ll N, L;
    vector<int> primes = sieve();
    cin >> N >> L;

    ll ans = 0;
    for (auto prime : primes) {
        ll rend = (ll)(N - 1) * (ll)prime;
        if (rend > L) break;
        ans += L - rend + 1;
    }
    cout << ans << endl;
    return 0;
}