#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <list>

using namespace std;

typedef long long ll;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(d) string(1,d)
#define print(x) cout<<#x<<" = "<<x<<endl;

#define MOD 1000000007

int prime[10000005];
int isPrime[10000005];

int sieve(int n){
  int p = 0;
  for(int i = 0; i <= n; i++){
    isPrime[i] = 1;
  }
  isPrime[0] = 0;
  isPrime[1] = 0;
  for(int i = 2; i <= n; i++){
    if(isPrime[i] == 1){
      prime[p] = i;
      p++;
      for(int j = 2 * i; j <= n; j += i){
        isPrime[j] = 0;
      }
    }
  }
  return p;
}

int main() {
  ll n,k;
  cin>>n>>k;
  sieve(10000003);
  ll ans = 0;
  rep(i,0,k){
  	if(isPrime[i]==0)continue;
  	if(i*(n-1)<=k){
  		ans += k-i*(n-1)+1;
  	}
  }
  cout << ans << endl;
  return 0;
}