#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1000 + 10;
int read(){
    char ch; int sum = 0,flag = 1;
	ch = getchar();
	while(ch < '0' || ch > '9'){ if(ch == '-') flag = -flag; ch = getchar();}
	while(ch >= '0' && ch <= '9'){sum = sum * 10 + ch - '0'; ch = getchar();}
	return sum * flag; 
}
int n,P;
int sum[N];
int ans,opt[N];
void dp(int res,int st){
//	cout << res << " " << st << "   " ;
	memset(opt,0,sizeof(opt));
	opt[0] = 1;
    for(int i = 1; i <= res; i++){
    	if(i == st) continue;
	    for(int j = i; j <= res; j++){
		    opt[j] = (opt[j] + opt[j - i]) % P;
		}
	}
	ans = (ans + (opt[res] * st % P)) % P;
//	cout << opt[res] << endl;
	return ;
}
signed main(){
    n = read(); P = read();
    for(int i = 1; i <= 50; i++){
	    sum[i] = sum[i - 1] + i;
	}   
	for(int i = 1; i <= 50; i++){
	    if(sum[i - 1] > n) break;
	    dp(n - sum[i - 1],i);
	}
	printf("%lld\n",ans % P);
	return 0;
}