д1

#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <climits>
#include <cstdlib>
#include<time.h>
#include<iomanip>
#include <ctime>
using namespace std;
const int N = 2e5 + 7;
long long dp[N], mod, dn_s, n, suffixsum[N], pows[30];
int main() {
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> mod;
	dp[n] = 1;
	dn_s = 0;
	pows[0] = 1;
	for (int i = 1; i < 30; i++) {
		pows[i] = pows[i - 1] * 2;
		pows[i] %= mod;
	}
	for (int i = n; i >= 1; i--) {
		dp[i] += dn_s;
		dp[i] %= mod;
		dn_s += dp[i];
		dn_s %= mod;
		for (int j = 2; j <= i; j++) {
			for (int pw = 29; pw >= 0; pw--) {
				if (i / j == (i / (j + pows[pw]))) {
					dp[i / j] += pows[pw] * dp[i];
					dp[i / j] %= mod;
					j += pows[pw];
				}
			}
			dp[i / j] += dp[i];
			dp[i / j] %= mod;
		}
	}
	cout << dp[1];

}