#include<bits/stdc++.h>
#define mint integer
#define N 3005
#define int long long
using namespace std;
int P;
struct integer {
    int u;
    explicit operator int() const {
        return u;
    }
    integer() : u(0) {
 
    }
    integer(long x) : u((int) (x % P)) {
        if (u < 0) {
            u = u + P;
        }
    }
    integer& operator += (integer a) {
        u = u + a.u;
        if (u >= P) {
            u = u - P;
        }
        return *this;
    }
    integer& operator -= (integer a) {
        u = u - a.u;
        if (u < 0) {
            u = u + P;
        }
        return *this;
    }
    integer& operator *= (integer a) {
        u = (int) ((long) u * a.u % P);
        return *this;
    }
    integer& operator /= (integer a) {
		assert(a.u != 0);
        return *this *= power(a, P - 2);
    }
    friend integer power(integer a, long p) {
        assert(p >= 0);
        integer b = 1;
        while (p > 0) {
            if (p % 2 == 1) {
                b = b * a;
            }
            a = a * a;
            p = p / 2;
        }
        return b;
    }
    friend bool operator == (integer a, integer b) {
        return a.u == b.u;
    }
    friend bool operator != (integer a, integer b) {
        return a.u != b.u;
    }
    friend integer operator + (integer a, integer b) {
        return a += b;
    }
    friend integer operator - (integer a, integer b) {
        return a -= b;
    }
    friend integer operator * (integer a, integer b) {
        return a *= b;
    }
    friend integer operator / (integer a, integer b) {
        return a /= b;
    }
    friend istream& operator >> (istream& i, integer& a) {
        long x;
        i >> x;
        a = integer(x);
        return i;
    }
    friend ostream& operator << (ostream& o, integer a) {
        o << (int) a;
        return o;
    }
};
int n;
mint m,f[N];
signed main(){
	cin>>n>>m.u>>P;
	f[1]=1ll; f[2]=m*m+2*m+1;
	f[3]=m*m*m/3 + m*m*2 + m*8/3+1;
	f[4]=m*m*m*7/3 + m*m*5 + m*11/3+1;
	f[5]=m*m*m*m*7/12 + m*m*m*17/3 + m*m*89/12 + m*13/3+1;
	f[6]=m*m*m*m*25/6 + m*m*m*38/3 + m*m*71/6 + m*16/3+1;
	f[7]=m*m*m*m*m*5/6 + m*m*m*m*37/3 + m*m*m*133/6 + m*m*47/3 + m*6+1;
	for(int i=8;i<=n;++i)
		f[i]=2*f[i-1] + 2*m*f[i-2] + ((0-m)*2-2)*f[i-3] + ((0-m)*m-m*2+1)*f[i-4] + m*2*f[i-5] + m*m*f[i-6];
	cout<<f[n].u<<'\n'; return 0;
}