#include <stdio.h>

int main () {
  int n = 0;
  long long m = 0LL;
  
  int res = 0;
  
  long long ans = 1LL;
  long long tmp[3][3] = {};
  
  res = scanf("%d", &n);
  res = scanf("%lld", &m);
  
  tmp[0][0] = 1;
  tmp[0][1] = 2;
  tmp[0][2] = 0;
  tmp[1][0] = 1;
  tmp[1][1] = 1;
  tmp[1][2] = 2;
  tmp[2][0] = 1;
  tmp[2][1] = 1;
  tmp[2][2] = 1;
  for (int i = 2; i < n; i++) {
    long long mul = 0LL;
    for (int j = 0; j < 3; j++) {
      for (int k = 0; k < 3; k++) {
        mul += tmp[j][k];
      }
    }
    ans *= mul%m;
    ans %= m;
    for (int j = 0; j < 2; j++) {
      long long tmp1[3][3] = { { 1LL, (long long)(2*i+j-1), 0LL }, { 1LL, 1LL, (long long)(2*i+j-1) }, { 1LL, 1LL, 1LL} };
      long long tmp2[3][3] = {};
      for (int k = 0; k < 3; k++) {
        for (int l = 0; l < 3; l++) {
          for (int p = 0; p < 3; p++) {
            tmp2[k][l] += tmp1[k][p]*tmp[p][l];
          }
        }
      }
      for (int k = 0; k < 3; k++) {
        for (int l = 0; l < 3; l++) {
          tmp[k][l] = tmp2[k][l]%m;
        }
      }
    }
  }
  
  for (int i = 0; i < 2*n-1; i++) {
    ans *= (long long)(i+1);
    ans %= m;
  }
  
  printf("%lld\n", ans%m);
  return 0;
}