#include <bits/stdc++.h> #define int long long using namespace std; int ans[20] = {0, 1, 0, 0, 2, 14, 90, 646, 5242, 47622, 479306, 5296790, 63779034, 831283558, 11661506218, 175203184374}; int n, M; int dp[1008][1008][2]; signed main() { while(cin >> n >> M) { if(n <= 15) { cout << ans[n] % M << endl; continue; } //挂了的dp memset(dp, 0, sizeof(dp)); dp[1][0][0] = n; for(int i = 2; i <= n; i++) { for(int j = 1; j <= i / 2; j++) { dp[i][j][1] = dp[i - 1][j - 1][0] * 2; } for(int j = 0; j <= i / 2; j++) { dp[i][j][0] = (dp[i - 1][j][0] + dp[i - 1][j][1]) * (n - i + 1) - dp[i][j + 1][1]; } } cout << dp[n][0][0] << endl; } return 0; }