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

#define _p(...) (void)printf(__VA_ARGS__)
#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define ALL(x) (x).begin(), (x).end()
#define BIT(n) (1LL<<(n))
#define SZ(x) ((int)(x).size())
#define fst first
#define snd second
typedef vector<int> vi;typedef vector<vi> vvi;typedef pair<int,int> pii;typedef vector<pii> vpii;
typedef long long ll;

// O(n log log n)
vector<int> sieve(int n) {
  vector<int> ret;
  if (n <= 2) return ret;
  vector<bool> ok(n / 2, true);
  ret.push_back(2);
  for (int i = 3; i < n; i += 2) {
    int i2 = i / 2;
    if (!ok[i2]) continue;
    ret.push_back(i);
    for (int j = i2 + i; j < n/2; j += i) ok[j] = false;
  }
  return ret;
}

void Main() {
  int N, L;
  scanf("%d%d", &N, &L);

  vi ps = sieve(L / (N-1) + 1);

  ll ans = 0;
  forr(p, ps) {
    int a = L - p * (N-1);
    //_p("%d:%d\n", p, a);
    ans += a + 1;
  }
  _p("%lld\n", ans);
}
int main() { cin.tie(0); ios::sync_with_stdio(false); Main(); return 0; }