#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;
typedef long long ll;
const int inf=1<<30;
const ll INF=1LL<<62;
typedef pair<int,int> P;
typedef pair<int,P> PP; 
const ll MOD=998244353;

int main(){
    ll N,M;
    cin>>N>>M;

    vector<ll> plus(N+1,M);
    for(int i=1;i<=N;i++){
        for(int j=i;j<=N;j+=i){
            plus[j]-=i;
        }
    }
    vector<ll> S(N+1);//S[x]= Σ(x mod i) (i=1,2,...,N)
    S[0]=0;
    for(int i=1;i<=N;i++){
        S[i]=S[i-1]+plus[i];
    }

    ll ans=0;
    for(int x=1;x<=N;x++){
        ans=max(ans,S[x]);
    }
    cout<<ans<<endl;

}