#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);

  int m = 550;
  vector<int> d(n + 1, 0);
  vector<mint> f(n + 1, 0);
  vector<vector<mint>> f_sum(m + 1, vector<mint>(n + 1, 0));

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

  for(int i = 3; i <= n; i++){
    mint sum = 0;

    for(int j = 1; j <= m; j++){
      if(i % j != 0) sum += f[i - i % j];
    }
    for(int j = 1; j <= m; j++){
      int l = i / (j + 1) + 1;
      int r = i / j;
      if(r * j == i) r--;
      l = max(l, m + 1);
      if(l > r) break;
      sum += f_sum[j][r * j] - f_sum[j][(l - 1) * j];
    }
    f[i] = (sum / i + 1) * i / (i - d[i]);
    for(int j = 1; j <= m; j++){
      if(i % j == 0) f_sum[j][i] = f_sum[j][i - j] + f[i];
    }
  }

  cout << f[n].val() << endl;
}