#include <iostream>
using namespace std;

const int N = 5e3 + 1;
int n, p, dp[N][N];

int main() {
	
	
	cin >> n >> p;
	dp[n][n] = 1;
	for(int i = n - 1; i >= 1; i--) {
		dp[i][i] += dp[i + 1][i + 1];
		dp[i][i] -= dp[i][i] >= p ? p : 0;
		for(int j = i << 1; j <= n; j += i) {
		    dp[i][i] += dp[i + 1][j];
		    dp[i][i] -= dp[i][i] >= p ? p : 0;
			for(int k = i + 1; k < j; k++) {
				dp[i][k] += dp[k + 1][j];
		        dp[i][k] -= dp[i][k] >= p ? p : 0;
			}
		}
		for(int j = 1; j <= n; j++) {
			dp[i][j] += dp[i + 1][j];
		    dp[i][j] -= dp[i][j] >= p ? p : 0;
		}
	}
	cout << dp[1][1];

	return 0;
}