#include<iostream>
#include<string>
#include<queue>
#include<vector>
#include<cassert>
#include<random>
#include<set>
#include<map>
#include<cassert>
#include<unordered_map>
#include<bitset>
#include<numeric>
#include<algorithm>
using namespace std;
using ll = long long;
const int inf=1<<30;
const ll INF=1LL<<62;
typedef pair<int,ll> P;
typedef pair<int,P> PP; 
const ll MOD=998244353;
const int dy[]={0,1,0,-1};
const int dx[]={1,0,-1,0};

int main(){
    ll N,M;
    cin>>N>>M;
    
    vector<ll> S(N+1);
    vector<ll> plus(N+1,M);
    S[0]=0;

    for(int i=1;i<=M;i++){
        for(int j=i;j<=N;j+=i){
            plus[j]-=i;
        }
    }

    for(int i=1;i<=N;i++){
        S[i]=S[i-1]+plus[i];
    }
    ll ans=0;
    for(int i=1;i<=N;i++){
        ans=max(ans,S[i]);
    }

    cout<<ans<<endl;
}