/*
Author: QAQAutomaton
Lang: C++
Code: E.cpp
Mail: lk@qaq-am.com
Blog: https://www.qaq-am.com/
*/
#include<bits/stdc++.h>
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define DEBUG printf("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define Debug debug("Passing [%s] in LINE %d\n",__FUNCTION__,__LINE__)
#define all(x) x.begin(),x.end()
#define x first
#define y second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
int inf;
const double eps=1e-8;
const double pi=acos(-1.0);
template<class T,class T2>int chkmin(T &a,T2 b){return a>b?a=b,1:0;}
template<class T,class T2>int chkmax(T &a,T2 b){return a<b?a=b,1:0;}
template<class T>T sqr(T a){return a*a;}
template<class T,class T2>T mmin(T a,T2 b){return a<b?a:b;}
template<class T,class T2>T mmax(T a,T2 b){return a>b?a:b;}
template<class T>T aabs(T a){return a<0?-a:a;}
template<class T>int dcmp(T a,T b){return a>b;}
template<int *a>int cmp_a(int x,int y){return a[x]<a[y];}
#define min mmin
#define max mmax
#define abs aabs
struct __INIT__{
	__INIT__(){
		memset(&inf,0x3f,sizeof(inf));
	}
}__INIT___;
namespace io {
	const int SIZE = (1 << 21) + 1;
	char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c, qu[55]; int f, qr;
	// getchar
	#define gc() (iS == iT ? (iT = (iS = ibuf) + fread (ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS ++)) : *iS ++)
	// print the remaining part
	inline void flush () {
		fwrite (obuf, 1, oS - obuf, stdout);
		oS = obuf;
	}
	// putchar
	inline void putc (char x) {
		*oS ++ = x;
		if (oS == oT) flush ();
	}
	template<typename A>
	inline bool read (A &x) {
		for (f = 1, c = gc(); c < '0' || c > '9'; c = gc()) if (c == '-') f = -1;else if(c==EOF)return 0;
		for (x = 0; c <= '9' && c >= '0'; c = gc()) x = x * 10 + (c & 15); x *= f;
		return 1;
	}
	inline bool read (char &x) {
		while((x=gc())==' '||x=='\n' || x=='\r');
		return x!=EOF;
	}
	inline bool read(char *x){
		while((*x=gc())=='\n' || *x==' '||*x=='\r');
		if(*x==EOF)return 0;
		while(!(*x=='\n'||*x==' '||*x=='\r'||*x==EOF))*(++x)=gc();
		*x=0;
		return 1;
	}
	template<typename A,typename ...B>
	inline bool read(A &x,B &...y){
		return read(x)&&read(y...);
	}
	template<typename A>
	inline bool write (A x) {
		if (!x) putc ('0'); if (x < 0) putc ('-'), x = -x;
		while (x) qu[++ qr] = x % 10 + '0',  x /= 10;
		while (qr) putc (qu[qr --]);
		return 0;
	}
	inline bool write (char x) {
		putc(x);
		return 0;
	}
	inline bool write(const char *x){
		while(*x){putc(*x);++x;}
		return 0;
	}
	inline bool write(char *x){
		while(*x){putc(*x);++x;}
		return 0;
	}
	template<typename A,typename ...B>
	inline bool write(A x,B ...y){
		return write(x)||write(y...);
	}
	//no need to call flush at the end manually!
	struct Flusher_ {~Flusher_(){flush();}}io_flusher_;
}
using io :: read;
using io :: putc;
using io :: write;
int n,k,p;
namespace work1{
	int f[155],g[155];
	int dp(int n,int k){
		f[0]=1;
		g[0]=1;
		for(int i=1;i<=n;++i){
			f[i]=0;
			for(int j=1;j<=k && j<=i;++j){
				(f[i]+=g[i==j?0:i-j-1])>=p?f[i]-=p:0;
		}
			(g[i]=f[i]+g[i-1])>=p?g[i]-=p:0;
		}
		return g[n];
	}
}
namespace work2{
	int f[79],g[79][79],l[79],r[79];
	int &add(int &a,int b){return (a+=b)>=p?a-=p:a;}
	void main(){
		int m1=n>>1,m2=(n+1)>>1;
		int w=1;
		g[0][0]=1;
		for(int i=1;i<=m1;++i){
			int x=((i<<1)-k+1);
			if(x<=0)l[i]=0;
			else l[i]=x>>1;
			x=((i<<1)+k+1);
			r[i]=x>>1;
			chkmin(r[i],m2+1);
		}
		for(int i=1;i<=m2;++i){
			g[0][i]=w;
			(w<<=1)>=p?w-=p:0;
		}
		for(int i=1;i<=m1;++i){
			for(int j=1;j<=i;++j){
				for(int k=0;k<=m2;++k)f[k]=g[j==1?0:j-2][k];
				if(l[i]>=r[j]){
					f[l[i]]=f[r[j]];
					for(int k=0;k<l[i];++k)f[k]=0;
					int w=f[l[i]];
					for(int k=l[i]+1;k<=m2;++k){
						f[k]=w;
						add(w,f[k]);
					}
				}
				else{
					if(r[j]<=m2){
						for(int k=0;k<l[i];++k)f[k]=0;
						int s=0;
						for(int k=0;k<=r[j];++k)add(s,f[k]);
						for(int k=r[j]+1;k<=m2;++k){
							f[k]=s;add(s,f[k]);
						}
					}
				}
				for(int k=0;k<=m2;++k)add(g[i][k],f[k]);
			}
			for(int j=0;j<=m2;++j){
				add(g[i][j],g[i-1][j]);
			}
		}
		int s=0;
		for(int i=0;i<=m2;++i)(s+=g[m1][i])>=p?s-=p:0;
		write(s,'\n');
	}
}
signed main(){
#ifdef QAQAutoMaton 
	freopen("E.in","r",stdin);
	freopen("E.out","w",stdout);
#endif
	read(n,k,p);
	if(!(k&1)){
		k>>=1;		
		write((ll)work1::dp(n>>1,k)*work1::dp(n-(n>>1),k)%p,'\n');
	}
	else{
		work2::main();
	}
	return 0;
}



Measured memory_bytes: 2304