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

typedef long long ll;

signed main(){
  int N, L; cin >> N >> L;
  vector< int > np( L );
  vector< int > pt;
  for( int i = 2; i < L; ++i )
    if( not np[ i ] ){
      pt.emplace_back( i );
      for( int j = i + i; j < L; j += i )
        np[ j ] = 1;
    }
  ll ans = 0;
  for( int i = 0; i < pt.size(); ++i ){
    ll len = 1LL * pt[ i ] * ( N - 1 );
    if( len <= L )
      ans += L - len + 1;
  }
  cout << ans << endl;
  return 0;
}