#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <queue>
#include <array>
#include <cmath>
#include <atcoder/modint>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(i64 i=0; i<(i64)(n); i++)
#define repr(i,n) for(i64 i=(i64)(n)-1; i>=0; i--)
const i64 INF = 1001001001001001001;
const char* yn(bool x){ return x ? "Yes" : "No"; }
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
template<typename A> using nega_queue = std::priority_queue<A,std::vector<A>,std::greater<A>>;
//using Modint = atcoder::static_modint<998244353>;
using namespace std;

using Modint = atcoder::dynamic_modint<998244353>;

void testcase(){
    i64 N, M; cin >> N >> M;
    Modint::set_mod(M);
    Modint x0 = 1;
    Modint x1 = 1;
    Modint x2 = 1;
    Modint ans = 1;
    for(i64 x=1; x<N; x++){
        ans *= x2;
        rep(t,2){
            Modint y0 = 0;
            Modint y1 = 0;
            Modint y2 = 0;
            y0 += x1 * (x*2+t) + x0;
            y1 += x2 * (x*2+t) + x0 + x1;
            y2 += x0 + x1 + x2;
            x0 = y0; x1 = y1; x2 = y2;
        }
    }
    Modint offset = 1;
    for(i64 i=1; i<=N*2-1; i++) offset *= i;
    ans *= offset;
    cout << ans.val() << endl;
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    #ifdef NACHIA
    int T; cin >> T; for(int t=0; t<T; T!=++t?(cout<<'\n'),0:0)
    #endif
    testcase();
    return 0;
}