#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define fst first #define scd second #define PB push_back #define MP make_pair #define int long long #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() #define omajinai ios::sync_with_stdio(false);cin.tie(0) typedef long long ll; typedef long double ld; typedef vector vi; typedef vector vvi; typedef pair pii; typedef vector vpii; templateT& max(T&a,T&b){if(a>=b)return a;return b;} templateT& min(T&a,T&b){if(abool chmax(T&a,T b){if(abool chmin(T&a,T b){if(a>b){a=b;return true;}return false;} templateT get(){T a;cin>>a;return a;} templateT rev(T a){reverse(all(a));return a;} templatevector&sort(vector&a){sort(all(a));return a;} const int inf = 1e9; const ll linf = 3e18; const double eps = 1e-9; bool is_prime[10000001]; signed main() { int N, L; cin >> N >> L; fill_n(is_prime, L+1, true); is_prime[0] = is_prime[1] = false; for (int i = 2; i <= L; ++i) { if (!is_prime[i]) continue; for (int j = i + i; j <= L; j += i) { is_prime[j] = false; } } ll ans = 0; for (int i = 2; i <= L; ++i) { if (!is_prime[i]) continue; if (i * (N - 1) > L) break; ans += L - i * (N - 1) + 1; } cout << ans << endl; }