#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <fstream>
#include <array>
#include <functional>
#include <stack>
#include <memory>
using namespace std;
#define int long long
int p;
int po(int a,int b) {if(b==0) return 1; if(b==1) return a; if(b%2==0) {int u=po(a,b/2);return (u*1LL*u)%p;} else {int u=po(a,b-1);return (a*1LL*u)%p;}}
int inv(int x) {return po(x,p-2);}
mt19937 rnd;
#define app push_back
#define all(x) (x).begin(),(x).end()
#ifdef LOCAL
#define debug(...) [](auto...a){ ((cout << a << ' '), ...) << endl;}(#__VA_ARGS__, ":", __VA_ARGS__)
#define debugv(v) do {cout<< #v <<" : {"; for(int izxc=0;izxc<v.size();++izxc) {cout << v[izxc];if(izxc+1!=v.size()) cout << ","; }cout <<"}"<< endl;} while(0)
#else
#define debug(...)
#define debugv(v)
#endif
#define lob(a,x) lower_bound(all(a),x)
#define upb(a,x) upper_bound(all(a),x)
const int maxn=1005;
int fact[maxn];int invf[maxn];
int n,m;
int C(int a,int b,int c)
{
    int ans=fact[a+b+c];ans*=invf[a];ans%=p;ans*=invf[b];ans%=p;ans*=invf[c];ans%=p;
    return ans;
}
const int maxs=1e4+1005;
int dps[2*maxs];int dps2[2*maxs];
bool check(vector<int> v)
{
    int s=accumulate(all(v),0LL);
    if(s==0) {return false;}
    int non0=0;for(int x:v) if(x) non0++;
    if(non0<=1) {return false;}
    int d=0;
    for(int x:v) d=__gcd(d,x);
    d=abs(d);
    for(int &x:v) {x/=d;}
    vector<int> vp,vm;
    for(int x:v) if(x>0) vp.app(x);
    for(int x:v) if(x<0) vm.app(x);
    if(count(all(vp),1)==vp.size()) return true;
    if(count(all(vm),-1)==vm.size()) return true;
    sort(all(v));
    vector<int> pr(v.size()+1);
    do
    {
        for(int i=0;i<v.size();++i) {pr[i+1]=pr[i]+v[i];}
        bool ok=1;
        for(int i=1;i<v.size();++i)
        {
            if(pr[i]==0 || pr[i]==s)
            {
                ok=0;
            }
        }
        if(ok) return true;
    }while(next_permutation(all(v)));
    debugv(v);
    return false;
}
bool real(vector<int> v)
{
    int s=accumulate(all(v),0LL);
    if(s==0) {return false;}
    int non0=0;for(int x:v) if(x) non0++;
    if(non0<=1) {return false;}
    sort(all(v));
    vector<int> pr(v.size()+1);
    do
    {
        for(int i=0;i<v.size();++i) {pr[i+1]=pr[i]+v[i];}
        bool ok=1;
        for(int i=1;i<v.size();++i)
        {
            if(pr[i]==0 || pr[i]==s)
            {
                ok=0;
            }
        }
        if(ok) return true;
    }while(next_permutation(all(v)));
    return false;
}
vector<vector<int> >  go(int n,int m)
{
    if(n==0) {return {{}};}
    vector<vector<int> > was=go(n-1,m);
    vector<vector<int> > have;
    for(vector<int> h:was)
    {
        for(int x=-m;x<=m;++x)
        {
            vector<int> h1=h;
            h1.app(x);
            if(!is_sorted(all(h1))) continue;
            have.app(h1);
        }
    }
    return have;
}
vector<vector<int> >  go2(int n,int m)
{
    if(n==0) {return {{}};}
    vector<vector<int> > was=go2(n-1,m);
    vector<vector<int> > have;
    for(vector<int> h:was)
    {
        for(int x=-m;x<=m;++x)
        {
            vector<int> h1=h;
            h1.app(x);
            have.app(h1);
        }
    }
    return have;
}
int stupid(int n,int m)
{
    vector<vector<int> > h=go2(n,m);
    debug(h.size());
    int ans=0;int cnt=0;
    for(auto v:h)
    {
        if(!real(v) && accumulate(all(v),0LL)) {++cnt;debugv(v);}
        ans+=real(v);
    }
    debug(cnt);
    return ans;
}
const int maxn1=105;
int dp1[3*maxn1][maxn1][maxn1];
int32_t main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    /*vector<vector<int> > aa=go(10,4);vector<vector<int> > aas;
    for(auto hh:aa) {sort(all(hh));aas.app(hh);}
    sort(all(aas));aas.erase(unique(all(aas)),aas.end());
    for(auto v:aas) {check(v);}
    debug("okk");*/
    cin>>n>>m>>p;
    //debug(stupid(n,m));
    fact[0]=1;for(int i=1;i<maxn;++i) {fact[i]=(fact[i-1]*i)%p;}
    for(int i=0;i<maxn;++i) {invf[i]=inv(fact[i]);}
    int al=po(2*m+1,n);
    int bad=2*n*m;bad%=p;
    dps[maxs]=1;
    for(int i=0;i<n;++i)
    {
        fill(dps2,dps2+2*maxs,0);
        for(int j=-m;j<=m;++j)
        {
            for(int s1=0;s1<2*maxs;++s1)
            {
                if(dps[s1])
                {
                    dps2[s1+j]+=dps[s1];if(dps2[s1+j]>=p) dps2[s1+j]-=p;
                }
            }
        }
        copy(dps2,dps2+2*maxs,dps);
    }
    bad+=dps[maxs];bad%=p;
    debug(bad);
    dp1[0][0][0]=1;
    debug("regrf");
    for(int mx=1;mx<=m;++mx)
    {
        for(int s=0;s<3*maxn1-mx;++s)
        {
            for(int n=0;n<maxn1;++n)
            {
                dp1[s][mx][n]+=dp1[s][mx-1][n];if(dp1[s][mx][n]>=p) dp1[s][mx][n]-=p;
            }
        }
        for(int s=3*maxn1-mx;s>=0;--s)
        {
            for(int cnt=1;cnt*mx+s<3*maxn1;++cnt) {
            for(int n=0;n<maxn1;++n)
            {
                dp1[s+cnt*mx][mx][n+cnt]+=(dp1[s][mx][n]*invf[cnt]);dp1[s+cnt*mx][mx][n+cnt]%=p;
            }
            }
        }
    }
    debug(dp1[1][1][1]);
    debug("rgef");
    int bad1=0;
    for(int np=0;np<=n;++np)
    {
        for(int s=1;s<np;++s)
        {
            for(int n0=0;n0<n-np;++n0) {
            int nm=n-n0-np;
            for(int mx=max(1LL,s-1);mx<=m;++mx)
            {
                int o=((2*(m/mx)*1LL*(dp1[np-s][mx][nm]-dp1[np-s][mx-1][nm]))%p);
                o*=fact[n];o%=p;
                o*=invf[np];o%=p;
                o*=invf[n0];o%=p;
                bad+=o;bad%=p;
                bad1+=o;bad1%=p;
            }
            }
        }
    }
    debug(bad1);
    cout<<((al-bad)%p+p)%p;
    return 0;
}