#include <iostream>
#include <vector>
using namespace std;

#include <atcoder/modint>
using namespace atcoder;

using mint = modint;

int main(){
  int n;
  cin >> n;
  long long p;
  cin >> p;

  mint::set_mod(p);

  vector<vector<int>> d(n + 1);
  for(int i = 1; i <= n; i++){
    for(int j = i; j <= n; j += i){
      d[j].emplace_back(i);
    }
  }

  vector<mint> f(n + 1, 0);
  mint tot = 0;
  for(int i = 3; i <= n; i++){
    mint sum = tot;
    for(int j: d[i]) sum -= f[j];
    f[i] = (sum / i + 1) * i / (i - d[i].size());
    tot = sum + f[i] * d[i].size();
    for(int j: d[i]) f[j] = f[i];
  }
  cout << f[n].val() << endl;
}