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

struct SieveEratos{
  vector<bool> t;
  vector<int> primes;
  SieveEratos(int n):t(n+1,true){
    t[0] = t[1] = false;
    for(int i = 2; n >= i; i++){
      if(t[i]){
        primes.emplace_back(i);
        for(int j = i+i; n >= j; j+=i){
          t[j] = false;
        }
      }
    }
  }
  bool operator[](int x){return t[x];}
};


int main(){
    long long n,l;cin>>n>>l;
    SieveEratos P(l+1);
    long long ans = 0;
    for(long long i = 2; l >= i; i++){
        if(P[i]){
            ans += max(0LL,l-((n-1)*i)+1);
        }
    }
    cout << ans << endl;
}