// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
//#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 998244353;//    1000000007

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef arwaeystoamneg
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "test1")
			freopen((s + ".out").c_str(), "w", stdout);
	}
#endif
}
int n, m;
struct mi
{
	int x;
	mi()
	{
		x = 0;
	}
	mi(int y)
	{
		x = y;
	}
	mi operator+(const mi& y)const
	{
		return (x + y.x >= m ? x + y.x - m : x + y.x);
	}
	void operator+=(const mi& y)
	{
		x = (x + y.x >= m ? x + y.x - m : x + y.x);
	}
	mi operator* (const mi& y)const
	{
		return ((ll)x * y.x) % m;
	}
};
int main()
{
	setIO("test1");
	cin >> n >> m;
	int zero = n * n + 5;
	vector<mi>c(n + 1);
	c[n] = 1;
	R0F(i, n)c[i] = c[i + 1] * (i + 1);
	reverse(all(c));

	vector<vector<mi>>dp(n + 1, vector<mi>(2 * zero));
	fill(dp[n].begin(), dp[n].begin() + zero, 1);
	mi ans;
	R0F(i, n)
	{
		F0R(j, 2 * zero)
		{
			if (j + 0 - (n - i - 1) < 0 || j + (n - i - 1) - 0 >= 2 * zero)continue;
			F0R(k, n - i)
			{
				F0R(l, n - i)
				{
						dp[i][j] += dp[i + 1][j + k - l];
				}
			}
		}
		int len = n - i;
		F0R(j, len)
		{
			F0R(k, j)
			{
				ans += dp[n - len + 1][j - k + zero] * c[n - len];
			}
		}
	}
	cout << ans.x << endl;
}