#include using namespace std; typedef signed long long ll; #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define FORR2(x,y,arr) for(auto& [x,y]:arr) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) template bool chmax(T &a, const T &b) { if(a bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;} //------------------------------------------------------- ll N; ll mo; ll dp[603030]; vector D[606060]; ll modpow(ll a, ll n = mo-2) { ll r=1;a%=mo; while(n) r=r*((n%2)?a:1)%mo,a=a*a%mo,n>>=1; return r; } void solve() { int i,j,k,l,r,x,y; string s; cin>>N>>mo; for(i=1;i<=N;i++) { for(j=i;j<=N;j+=i) D[j].push_back(i); } for(i=3;i<=N;i++) { (dp[i+1]+=dp[i])%=mo; dp[i]=(i*modpow(i-D[i].size())%mo+dp[i]%mo*modpow(i-D[i].size()))%mo; FORR(d,D[i]) if(d>1) { (dp[i+1]+=dp[i])%=mo; (dp[i+d]+=mo-dp[i])%=mo; } } cout<