#include <bits/stdc++.h>
using namespace std;

const int N = 1e7;
bool isPrime[N + 1];

int main() {
    for (int i = 2; i <= N; ++i) isPrime[i] = true;
    for (int i = 2; i * i <= N; ++i) if (isPrime[i]) {
        for (int j = i * i; j <= N; j += i) if (isPrime[j]) {
            isPrime[j] = false;
        }
    }
    int n; cin >> n;
    int l; cin >> l;
    long long res = 0;
    for (int d = 1; 1LL * (n - 1) * d <= l; ++d) if (isPrime[d]) {
        res += l - (n - 1) * d + 1;
    }
    cout << res << '\n';
    return 0;
}