#include<bits/stdc++.h>
bool Mbg;
using namespace std;
#define vec vector
#define pb push_back
#define eb emplace_back
#define siz(vec) ((int)(vec).size())
#define all(vec) (vec).begin(),(vec).end()
template<class T>
void operator +=(vec<T> &a,T b){a.push_back(b);}
template<class T>
void operator --(vec<T> &a){a.pop_back();}
#define pii pair<int,int>
#define x first
#define y second
#define mp make_pair
#define exc(exp) if(exp)continue;
#define stop(exp) if(exp)break;
#define ret(exp) if(exp)return;
#define deb(var) cerr<<#var<<'='<<(var)<<"; "
#define debl(var) cerr<<#var<<'='<<(var)<<";\n"
#define ins insert
#define era erase
#define lb lower_bound
#define ub upper_bound
#define int long long
#define inf (long long)(1e18)
template<class T>
bool Min(T &x,T y){return x>y?x=y,1:0;}
template<class T>
bool Max(T &x,T y){return x<y?x=y,1:0;}
int mod;
void Add(int &x,int y){x=x+y<mod?x+y:x+y-mod;}
void Dec(int &x,int y){x=x>=y?x-y:x-y+mod;}
int fpm(int x,int y){
    int ans=1;for(;y;y>>=1,x=1ll*x*x%mod)if(y&1)ans=1ll*x*ans%mod;return ans;
}
const int D=10000;

int n,m,ans;
int f[110][20110],g[20110];
void sol(int m,int* f){
    f[D]=1;
    for(int i=1;i<=n;i++){
        for(int j=0;j<=2*D+m;j++){
            g[j]=f[j];
            if(j)Add(g[j],g[j-1]);
        }
        for(int j=2*D;j;j--){
            f[j]=f[j-1];
        }
        f[0]=0;
        for(int j=0;j<=2*D;j++){
            Add(f[j],g[j+m]);
            if(j)Add(f[j],mod-g[j-1]);
        }
    }
}
void sol2(int* f){
    f[D]=1;
    for(int i=1;i<=n;i++){
        for(int j=0;j<=2*D+m;j++){
            g[j]=f[j];
            if(j)Add(g[j],g[j-1]);
        }
        for(int j=0;j<=2*D;j++){
            f[j]=g[j+m];
            if(j>m){
                Add(f[j],mod-g[j-m-1]);
            }
        }
    }
    Add(ans,f[D]);
}
void work(){
    cin>>n>>m>>mod;

    for(int i=-1;i<=m;i++){
        sol(i,f[i+1]);
    }

    for(int p=1;p<=m;p++){
        // max negative>=sum-1
        // sum>0
        // max negative<=m/p

        //p,2p,3p,...

        for(int s=D+1;s<=D*2;s++){
            Add(ans,f[m/p+1][s]);
        }

        for(int s=1;s<=n*m;s++){
            Add(ans,mod-f[min(m/p,s-2)+1][s+D]);
        }
    }

    (ans*=2)%=mod;

    sol2(f[m+2]);


    cout<<(fpm(2*m+1,n)+mod-ans%mod)%mod<<'\n';
}
bool Med;
signed main(){
    ios::sync_with_stdio(0),
    cin.tie(0),cout.tie(0);
    int T=1;while(T--)work();
    // cerr<<"Time: "<<clock()<<" ms;\n";
    // cerr<<"Memory: "<<abs(&Med-&Mbg)/1024.0/1024.0<<" MiB.\n";
}
/*
- CONTINUE, NON-STOPPING, FOR THE FAITH
- START TYPING IF YOU DON'T KNOW WHAT TO DO
- STOP TYPING IF YOU DON'T KNOW WHAT YOU'RE DOING
*/