#include<bits/stdc++.h>
using namespace std;

using ll = long long;
#define rep(i, n) for(ll i = 0; i < (n); ++i)
#define rep2(i, l, r) for(ll i = (l); i < (r); ++i)

using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;

#define all(A) A.begin(), A.end()
#define elif else if
using pii = pair<ll, ll>;

bool chmin(auto &a, auto b) {return a > b ? a = b, 1 : 0;}
bool chmax(auto &a, auto b) {return a < b ? a = b, 1 : 0;}

struct IOS {
  IOS() {
    cin.tie(0);
    ios::sync_with_stdio(0);
  }
} iosetup;

template<class T>
void print(vector<T> a) {
  for(auto x : a) cout << x << ' ';
  cout << endl;
}

void print(auto x) {cout << x << endl;}

template<class Head, class... Tail>
void print(Head &&head, Tail &&...tail) {
  cout << head << ' ';
  print(forward<Tail>(tail)...);
}

ll mod;
ll n,m;
int M=110;

ll calc1(){
  vector<vll>dp(2*M+1,vll(M+1,0));
  int off=M;
  dp[off+0][0]=1;
  rep(_,n){
    vector<vll>ndp(2*M+1,vll(M+1,0));
    rep2(sm,-M,M+1){
      rep2(mn,0,M+1){
        rep2(val,-m,2){
          if(-M<=sm+val&&sm+val<=M){
            int nsm=sm+val;
            int nmn=max(mn,-val);
            ndp[nsm+off][nmn]+=dp[sm+off][mn];
            ndp[nsm+off][nmn]%=mod;
          }
        }
      }
    }
    dp=ndp;
  }
  ll res=0;
  rep2(p,1,m+1){
    rep2(sm,-M,M+1){
      rep2(mn,0,M+1){
        if(sm>=1&&mn+2>sm){
          if(p*mn<=m){
            res+=2*dp[sm+off][mn];
          }          
        }
      }
    }     
  }
  return res;
}


ll calc2(){
  vll dp(2*M*M+1,0);
  dp[M*M]=1;
  rep(_,n){
    vll ndp(2*M*M+1,0);
    rep(i,2*M*M+1){
      rep2(d,-m,m+1){
        if(0<=i+d&&i+d<=2*M*M){
          ndp[i+d]+=dp[i];
          ndp[i+d]%=mod;
        }
      }
    }
    dp=ndp;
  }
  return dp[M*M];
}

int main(){
  cin>>n>>m>>mod;
  ll ans=1;
  rep(i,n){
    ans*=2*m+1;
    ans%=mod;
  }
  ll sub1=calc1();
  ll sub2=calc2();
  ans-=sub1;
  ans-=sub2;
  ans%=mod;
  ans=(ans+mod)%mod;
  cout<<ans<<endl;
}