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

#define REP(i,n) for(int i=0;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<29
#define LINF LLONG_MAX/3
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(v) (v).begin(),(v).end()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;

set<ll> prime;
void getprime(ll n){
    vector<bool> p(n+1,true);
    p[2]=true;
    for(ll i=2;i*i<=n;i++){
        if(!p[i]) continue;
        for(ll j=2;i*j<=n;j++){
            p[i*j]=false;
        }
    }

    for(ll i=2;i<=n;i++) if(p[i]) prime.insert(i);
}

int main(){
    ll n,l;
    cin>>n>>l;
    ll dmax=l/(n-1);
    getprime(dmax);

    ll sum=0;
    for(int p:prime){
        ll maxx = (n-1)*p;
        sum += l-maxx+1;
    }
    cout << sum << endl;
}