#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define eps 1e-8
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
int n,mod;
#define M 3000000
int phi[3000005],p[3000005],vis[3000005];
int sumphi[3000005];
int cnt=0,inv6;
map<int,int>mp;
int qp(int x,int y){
	int ans=1;
	while(y){
		if(y&1)ans=(ll)ans*x%mod;
		y>>=1;
		x=(ll)x*x%mod;
	}
	return ans;
}
int fsum(int x){
	return (ll)x*(x+1)%mod*(x+x+1)%mod*inv6%mod;
}
int Phi(int x){
	if(x<=M)return sumphi[x];
	if(mp.find(x)!=mp.end())return mp[x];
	int ans=(ll)x*(x+1)/2%mod;
	int L=2;
	while(L<=x){
		int R=x/(x/L);
		ans=(ans-(ll)(R-L+1)*Phi(x/L))%mod;
		L=R+1;
	}
	return mp[x]=(ans+mod)%mod;
}
int main(){
	vis[1]=1,phi[1]=1;
	for(int i=2;i<=M;i++){
		if(!vis[i])p[++cnt]=i,phi[i]=i-1;
		for(int j=1;j<=cnt&&i*p[j]<=M;j++){
			vis[i*p[j]]=1;
			if(i%p[j]==0){
				phi[i*p[j]]=phi[i]*p[j];
				break;
			}
			phi[i*p[j]]=phi[i]*phi[p[j]];
		}
	}
	scanf("%d%d",&n,&mod);
	for(int i=1;i<=M;i++)sumphi[i]=(sumphi[i-1]+phi[i])%mod;
	// for(int i=1;i<=n;i++)printf("%d ",sumphi[i]);printf("\n");
	inv6=qp(6,mod-2);
	int L=1,ans=0;
	while(L<=n){
		int R=n/(n/L);
		// printf("%d %d %d\n",fsum(n/L),Phi(R),Phi(L-1));
		ans=(ans+(ll)fsum(n/L)*(Phi(R)-Phi(L-1)))%mod;
		L=R+1;
	}
	printf("%d",(ans+mod)%mod);
	return 0;
}
// quod erat demonstrandum