#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define endl "\n"
typedef pair<int, int> Pii;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define ALL(x) begin(x), end(x)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(s) (s).begin(),(s).end()
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
#define rever(vec) reverse(vec.begin(), vec.end())
#define sor(vec) sort(vec.begin(), vec.end())
#define fi first
#define se second
#define pb push_back
#define P pair<ll,ll>
#define PQminll priority_queue<ll, vector<ll>, greater<ll>>
#define PQmaxll priority_queue<ll,vector<ll>,less<ll>>
#define PQminP priority_queue<P, vector<P>, greater<P>>
#define PQmaxP priority_queue<P,vector<P>,less<P>>
#define NP next_permutation
typedef string::const_iterator State;
class ParseError {};
//const ll mod = 1000000009;
const ll mod = 998244353;
//const ll mod = 1000000007;
const ll inf = 4100000000000000000ll;
const ld eps = ld(0.00000000001);
//static const long double pi = 3.141592653589793;
template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}
template<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}
template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}
void yes(bool a){cout<<(a?"yes":"no")<<endl;}
void YES(bool a){cout<<(a?"YES":"NO")<<endl;}
void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}
void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }
void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }
void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }
template<class T>auto min(const T& a){ return *min_element(all(a)); }
template<class T>auto max(const T& a){ return *max_element(all(a)); }
template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<endl;}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0;}
template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}
ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}
ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
ll pop(ll x){return __builtin_popcountll(x);}
ll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;}
P hyou(P a){ll x=fastgcd(abs(a.fi),abs(a.se));a.fi/=x;a.se/=x;if(a.se<0){a.fi*=-1;a.se*=-1;}return a;}
P Pplus(P a,P b){ return hyou({a.fi*b.se+b.fi*a.se,a.se*b.se});}
P Ptimes(P a,ll b){ return hyou({a.fi*b,a.se});}
P Ptimes(P a,P b){ return hyou({a.fi*b.fi,a.se*b.se});}
P Pminus(P a,P b){ return hyou({a.fi*b.se-b.fi*a.se,a.se*b.se});}
P Pgyaku(P a){ return hyou({a.se,a.fi});}

void cincout(){
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(15);
}
using Board = array<ll,4>;
using mint = modint;
map<Board,bool> check;
map<Board,bool> ok;
map<Board,bool> seen;
int n,m;
vector<mint> dsum;
vector<int> X={1,1,1,-1,-1},Y={-1,0,1,1,-1};
bool dfs(Board a){
  int x=pop(a[0])+pop(a[1]);
  if(x==1){
    ok[a]=(a[2]==1);
    return ok[a];
  }
  int p=a[2],q=a[3];
  Board b=a;
  b[p]-=(1ll<<q);
  bool finish=false;
  for(int i=0;i<5;i++){
    int np=p+X[i],nq=q+Y[i];
    if(np<0||np>=2||nq<0||nq>=m) continue;
    if((b[np]>>nq)&1){
      b[2]=np,b[3]=nq;
      if(!check[b]) continue;
      if(dfs(b)){
        finish=true;
      }
    }
  }
  if(finish) ok[a]=true;
  return finish;
}
void dfs2(Board a){
  seen[a]=true;
  if(pop(a[0])+pop(a[1])==2*m){
    dsum[a[3]]++;
    return;
  }
  for(int i=0;i<5;i++){
    int np=a[2]-X[i],nq=a[3]-Y[i];
    if(np<0||np>=2||nq<0||nq>=m) continue;
    if(!((a[np]>>nq)&1)){
      Board b=a;
      b[2]=np;
      b[3]=nq;
      b[np]+=(1ll<<nq);
      if(seen[b]) continue;
      if(ok[b]){
        dfs2(b);
      }
    }
  }
}
vector<vector<mint>> multi(vector<vector<mint>> &a,vector<vector<mint>> &b){
  vector<vector<mint>> c(a.size(),vector<mint>(b[0].size()));
  for(int i=0;i<int(a.size());i++){
    for(int k=0;k<int(b.size());k++){
      for(int j=0;j<int(b[0].size());j++){
        c[i][j]+=a[i][k]*b[k][j];
      }
    }
  }
  return c;
}
vector<vector<mint>> mul_exp(vector<vector<mint>> adj, ll k){
  if (k == 1) return adj;
  vector<vector<mint>> res(int(adj.size()),vector<mint>(int(adj[0].size())));
  for(int i=0;i<int(adj.size());i++){
    res[i][i]=1;
  }
  while(k>0){
    if(k&1) res=multi(adj,res);
    adj=multi(adj,adj);
    k/=2;
  }
  return res;
}
int main() {
  cincout();
  cin>>n>>m;
  if(m==1){
    cout<<1<<endl;
    return 0;
  }
  if(n%2){
    cout<<0<<endl;
    return 0;
  }
  ll M;
  cin>>M;
  mint::set_mod(M);
  for(int i=0;i<=m;i++){
    for(int j=i;j<=m;j++){
      for(int x=0;x<2;x++){
        for(int y=0;y<2;y++){
          for(int z=0;z<2;z++){
            Board u;
            u[0]=u[1]=u[2]=u[3]=0;
            for(int k=0;k<m;k++){
              if(i>k){
                if(x){
                  u[0]+=(1ll<<k);
                  u[1]+=(1ll<<k);
                }
              }
              else if(j>k){
                if((z+k)%2==0){
                  u[0]+=(1ll<<k);
                }
                else{
                  u[1]+=(1ll<<k);
                }
              }
              else{
                if(y){
                  u[0]+=(1ll<<k);
                  u[1]+=(1ll<<k);
                }
              }
            }
            for(int k=0;k<m;k++){
              if((u[0]>>k)&1){
                u[2]=0;
                u[3]=k;
                check[u]=true;
              }
              if((u[1]>>k)&1){
                u[2]=1;
                u[3]=k;
                check[u]=true;
              }
            }
          }
        }
      }
    }
  }
  vector<vector<mint>> sum(m);
  for(int i=0;i<m;i++){
    Board u;
    u[0]=u[1]=(1ll<<m)-1;
    u[2]=0;
    u[3]=i;
    if(check[u]){
      dfs(u);
    }
  }
  for(int i=0;i<m;i++){
    Board u;
    u[0]=u[1]=0;
    u[2]=1;
    u[3]=i;
    u[1]+=(1ll<<i);
    sum[i].resize(m);
    if(ok[u]){
      dsum.resize(m);
      for(auto &e:dsum) e=0;
      dfs2(u);
      sum[i]=dsum;
      seen.clear();
    }
  }
  vector<vector<mint>> dp(m,vector<mint>(m));
  for(int i=0;i<m;i++) dp[i][i]=1;
  vector<vector<mint>> dp2(m,vector<mint>(m));
  for(int i=0;i<m;i++){
    dp2[i][i]=1;
    if(i) dp2[i][i-1]=1;
    if(i!=m-1) dp2[i][i+1]=1;
  }
  for(int i=0;i<n/2;i++){
    dp=multi(dp,sum);
    if(i!=n/2-1) dp=multi(dp,dp2);
  }
  mint ans=0;
  for(auto e:dp){
    for(auto ee:e) ans+=ee;
  }
  cout<<ans.val()<<endl;
}