#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <sstream>
#include <string>
#define repd(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
#define mod 1000000007
#define inf 2000000007
#define mp make_pair
#define pb push_back
typedef long long ll;
using namespace std;
template <typename T>
inline void output(T a, int p) {
    if(p) cout << fixed << setprecision(p)  << a << "\n";
    else cout << a << "\n";
}
// end of template

int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    // source code
    int N;
    int L;
    cin >> N >> L;
    if(N > L) {
        output(0, 0);
        return 0;
    }
    
    int M = L / (N - 1);
    vector<int> isPrime(M + 1, 1);
    isPrime[0] = isPrime[1] = 0;
    for(int i = 2; i * i <= M; i++){
        if(isPrime[i] == 0) continue;
        for(int j = i * i; j <= M; j += i){
            isPrime[j] = 0;
        }
    }
    
    ll ret = 0;
    
    rep(i, M + 1){
        if(isPrime[i] == 0) continue;
        ll range = (ll)i * (N - 1);
        ret += L - range + 1;
    }
    
    output(ret, 0);
    
    return 0;
}