#include <bits/stdc++.h>

 using namespace std;

 typedef long long ll;

 int mod;

 struct mat

 {

     ll a[][];

     int n, m;

     mat()

     {

         memset(a, , sizeof(a));

         n = , m = ;

     }

     mat(int x, int y)

     {

         memset(a, , sizeof(a));

         n = x, m = y;

     }

     mat operator* (const mat &rhs) const

     {

         mat ans;

         ans.n = n, ans.m = rhs.m;

         for(int i = ; i <= n; ++i)

             for(int j = ; j <= rhs.m; ++j)

                 for(int k = ; k <= m; ++k)

                     ans.a[i][j] = (ans.a[i][j] + a[i][k] * rhs.a[k][j]) % mod;

         return ans;

     }

     mat operator^ (ll rhs) const

     {

         mat ans(n, n), b = *this;

         for(int i = ; i <= n; ++i)

             ans.a[i][i] = ;

         for(; rhs; rhs >>= , b = b * b)

             if(rhs & ) ans = ans * b;

         return ans;

     }

 };

 int main()

 {

     ll n, c;

     mat ans(, ), b(, );

     scanf("%lld%d", &n, &mod);

     ans.a[][] = ;

     for(int i = ; i <= ; ++i)

         for(int j = ; j <= i; ++j)

             b.a[i][j] = ;

     for(ll i = ; ; i *= )

     {

         b.a[][] = i % mod;

         if(i <= n) c = i /  * ;

         else c = n - i /  + ;

         ans = ans * (b ^ c);

         if(i > n) break;

     }

     printf("%lld\n", ans.a[][]);

     return ;

 }