#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

//実行時modint 
ll mod;
int max_n = 200005;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-()  { return mint(-x);}
  mint& operator+=( mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=( mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=( mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+( mint a) { return mint(*this) += a;}
  mint operator-( mint a) { return mint(*this) -= a;}
  mint operator*( mint a) { return mint(*this) *= a;}
  mint pow(ll t) {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
  bool operator==( mint &p) { return x == p.x; }
  bool operator!=( mint &p) { return x != p.x; }
  // for prime mod
  mint inv() { return pow(mod-2);}
  mint& operator/=(mint a) { return *this *= a.inv();}
  mint operator/( mint a) { return mint(*this) /= a;}
};
istream& operator>>(istream& is, mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, mint& a) { return os << a.x;}
using vm=vector<mint>;
using vvm=vector<vm>;


int main(){
    ll n;cin >> n >> mod;
    vm dp(n+1);
    vvl  divs(n+1);
    for(ll i=1;i<=n;i++){
        for(ll j=i;j<=n;j+=i){
            divs[j].emplace_back(i);
        }
    }
    mint sum=0;
    for(ll i=3;i<=n;i++){
        mint cof=1;
        mint inv=mint(i).inv();
        cof-=inv*divs[i].size();
        mint ds=sum;
        for(auto x:divs[i])ds-=dp[x];
        ds*=inv;ds+=1;
        ds/=cof;
        //cout << ds << endl;
        for(auto x:divs[i]){
            sum-=dp[x];
            dp[x]=ds;
            sum+=dp[x];
        }
    }
    cout << dp[n] << endl;
}