#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n; cin >> n;
	long long p; cin >> p;
	mint::set_mod(p);
	vector<vector<int>>d(n + 1);
	rep2(i, 1, n + 1) {
		for (int j = i; j <= n; j += i) {
			d[j].push_back(i);// yakusuuu
		}
	}
	vector<mint>dp(n + 1);
	vector<int>memo(n + 1, 1);
	memo[1] = memo[2] = 2;
	mint sum = 0;
	rep2(i, 3, n + 1) {
		mint tmp = 0;
		for (auto e : d[i]) {
			sum -= dp[memo[e]];
			memo[e] = i;
		}
		dp[i] = (sum + i) / (i - d[i].size());
		sum += dp[i] * d[i].size();
	}
	cout << dp[n].val() << endl;
	return 0;
}