#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

bool isNotPrime[10000000];
vector<int> primes;

int main(){
    //*
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    /*/
      /*/

    primes.emplace_back(2);
    for(int i=4;i<10000000;i+=2){
        isNotPrime[i] = true;
    }

    for(int i=3;i<10000000;i+=2){
        if(!isNotPrime[i]){
            primes.emplace_back(i);
            for(int j=i*2;j<10000000;j+=i){
                isNotPrime[j] = true;
            }
        }
    }
    
    int N, L;
    std::cin >> N >> L;
    
    ll res = 0ll;
    for(int p : primes){
        int a = L / p + 1, b = L % p + 1;
        
        if(a >= N){
            res += 1ll * b * (a - N + 1);
            res += 1ll * (p - b) * (a - N);
        }
    }

    std::cout << res << std::endl;
}