#include <bits/stdc++.h>
using namespace std;
int n , m , mod ;
int fpow(int a,int b) {
    int ans = 1;
    while(b) {
        if(b & 1) ans = 1LL * ans * a %mod;
        a = 1LL * a * a % mod ; b >>= 1;
    }
    return ans;
}
int t[105] , rt[105];
int C(int a,int b) {
    return 1LL * t[a] * rt[b] % mod * rt[a - b] % mod;
}
const int D = 1e4 ;
// int f[20005] , g[20005];
int calc() {
    vector<int> f(20005) , g(20005) ;
    f[D] = 1;
    for(int i = 1;i <= n;i++) {
        for(int j = -i*m ; j <= i *m;j++) {
            f[D + j] = (f[D + j] + f[D + j - 1]) % mod;
        }
        for(auto &x : g) x = 0;
        for(int j = -i * m ; j <= i * m ; j++) {
            g[D + j] = (f[D + min(i*m , j + m)] - f[max(0 , D + j - m - 1)] + mod) % mod;
        }
        for(int j = -i*m ; j <= i*m;j++) f[D + j] = g[D + j] ;
    }
    return f[D];
}

int f[105][105][105] , g[105][105][105];

int calcm(int mx) { //// max <= mx
    // vector<vector<int> > f(n + 1 , vector<int>(n + 1)) ;
    // vector<vector<int> > g(n + 1 , vector<int>(n + 1)) ;
    f[mx][0][0] = 1;
    for(int i = 0;i <= n;i++) g[mx][0][i] = 1;
    for(int i = 1;i <= n;i++) {
        for(int j = 0 ; j <= n ; j++) {
            if(j <= mx) f[mx][i][j] = g[mx][i - 1][j];
            else f[mx][i][j] = (g[mx][i - 1][j] - g[mx][i - 1][j - mx - 1] + mod) % mod;
            f[mx][i][j] = (f[mx][i][j] - f[mx][i - 1][j] + mod) % mod;
        }

        g[mx][i][0] = f[mx][i][0];
        for(int j = 1;j <= n;j++) {
            g[mx][i][j] = (f[mx][i][j] + g[mx][i][j - 1]) % mod;
        }
    }

    int ans = 0;
    for(int neg = 1 ; neg < n ; neg++) {
        // printf("neg %d : %d : %d\n" , neg , g[n - neg][neg - 1] - g[n-neg][min(neg-1 , max(0,lm-1))]  , (g[n - neg][neg - 1] - g[n-neg][min(neg-1 , max(0,lm-1))]  ) * C(n , neg)) ;
        // printf("B %d : %d\n" , min(neg - 1 , max(0 , lm - 1)) , lm) ;
        for(int zero = 0 ; zero + neg < n ; zero++) {

            // int lm = (n - zero - 1) / 2;
            int lm = neg - mx - 1;

            int tk = (g[mx][n - neg - zero][neg - 1] - g[mx][n-neg - zero][min(neg-1 , max(0,lm-1))] + mod) % mod;
            int pre = (g[mx - 1][n - neg - zero][neg - 1] - g[mx - 1][n-neg - zero][min(neg-1 , max(0,lm-1))] + mod) % mod;
            tk = (tk - pre + mod) % mod;

            ans = (ans + 1LL * tk * C(n , neg) % mod * C(n-neg , zero)) % mod;
            
        }
    }
    ans = ans*2 % mod;
    return ans;
}
int main() {
    cin >> n >> m >> mod ;
    t[0] = rt[0] = 1;
    for(int i = 1;i <= n;i++) {
        t[i] = 1LL * t[i - 1] * i % mod;
        rt[i] = fpow(t[i] , mod - 2) ;
    }
    int ans = fpow(m*2 + 1 , n) ;
    ans = (ans - calc() + mod) % mod; /// case1

    ans = (ans - 1LL * (m*2) * n + mod) % mod; // case2
    

    vector<int> sol(m + 1);
    for(int mx = 1 ; mx <= m ; mx++) {
        sol[mx] = calcm(mx) ;
        // printf("%d %d\n",mx,sol[mx]) ;
    }
    for(int i = 1;i <= m;i++) {
        // int s = (sol[i] - sol[i - 1] + mod) % mod;
        int s=sol[i];
        ans = (ans - 1LL * s * (m/i) % mod + mod) % mod;
    }
    cout << ans << '\n' ;
}