#include <bits/stdc++.h>
using namespace std;
using int64 = long long;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, P;
    cin >> N >> P;
    vector<int> d(N + 1, 0);
    vector<vector<int>> divs(N + 1);
    for (int b = 1; b <= N; ++b) {
        for (int m = b; m <= N; m += b) {
            d[m]++;
            divs[m].push_back(b);
        }
    }
    vector<int> inv(N + 2, 0);
    inv[1] = 1;
    for (int i = 2; i <= N + 1; ++i) {
        inv[i] = int64(P - P / i) * inv[P % i] % P;
    }
    vector<int> diff(N + 2, 0);
    int64 curF = 0;
    vector<int> E(N + 1, 0);
    for (int m = 1; m <= N; ++m) {
        curF = (curF + diff[m]) % P;
        if (m >= 3) {
            int64 numer = (m + curF) % P;
            int denom = m - d[m];
            E[m] = numer * inv[denom] % P;
        }
        int em = E[m];
        if (em) {
            for (int b : divs[m]) {
                int L = m + 1;
                int R = min(N, m + b - 1);
                if (L > R) continue;
                diff[L] = (diff[L] + em) % P;
                diff[R + 1] = (diff[R + 1] - em + P) % P;
            }
        }
    }
    cout << E[N] << "\n";
    return 0;
}