#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000008, MOD = 998244353, INF = 0x3f3f3f3f;
ll res;
int n, m, cnt, w[N];

int f[300086], p;
int s[300086][200], inv[300086];
int main() {
    map<int, int> ma;
    cin >> n >> p;
    inv[1] = 1;
    for (int i = 2; i <= 300000; i++) inv[i] = (ll)(p - p / i) * inv[p % i] % p;
    int d = 600;
    for (int i = 3; i <= n; i++) {
        int l = d;
        ll c = 0;
        for (int j = 1; j < d; j++) {
            int t = i - (i % j);
            c += t == i;
            f[i] = f[i] + (t != i ? f[t] : 0);
            f[i] = f[i] >= p ? f[i] - p : f[i];
        }
        while (l <= i) {
            int g = i / l, r = i / g, pr = i % l, pl = pr - (r - l) * g;
            c += pl == 0, pl = pl == 0 ? g : pl;
            if (g < 200) {
                int t = (pl <= pr ? s[i - pl][g] - s[i - pr][g] + f[i - pr] : 0);
                t = t >= p ? t - p : t;
                t = t < 0 ? t + p : t;
                f[i] = f[i] + t;
                f[i] = f[i] >= p ? f[i] - p : f[i];
                // f[i] = (f[i] + (pl <= pr ? s[i - pl][g] - s[i - pr][g] + f[i - pr] + p : 0)) % p;
            } else {
                for (int j = i - pr; j <= i - pl; j += g) {
                    f[i] = f[i] + f[j];
                    f[i] = f[i] > p ? f[i] - p : f[i];
                }
            }
            l = r + 1;
        }
        f[i] = ((ll)f[i] * inv[i] + 1) % p;
        f[i] = (ll)f[i] * inv[i - c] % p * i % p;
        for (int j = 1; j < 200; j++)
            s[i][j] = i >= j ? s[i - j][j] + f[i] >= p ? s[i - j][j] + f[i] - p : s[i - j][j] + f[i] : f[i];
    }
    printf("%d\n", f[n]);
    return 0;
}