C.cpp

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ull unsigned long long
#define dd double
#define ld long double
#define sl(n) scanf("%lld", &n)
#define si(n) scanf("%d", &n)
#define sd(n) scanf("%lf", &n)
#define pll pair <ll, ll>
#define pii pair <int, int>
#define mp make_pair
#define pb push_back
#define inf (1LL << 62)
#define loop(i, start, stop, inc) for(ll i = start; i <= stop; i += inc)
#define for1(i, stop) for(ll i = 1; i <= stop; i++)
#define for0(i, stop) for(ll i = 0; i < stop; i++)
#define rep1(i, start) for(ll i = start; i >= 1; i--)
#define rep0(i, start) for(ll i = (start-1); i >= 0; i--)
#define ms(n, i) memset(n, i, sizeof(n))
#define casep(n) printf("Case %lld:", ++n)
#define pn printf("\n")
#define pf printf
#define fastio std::ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

ll fact[250009], m, comb[250009], cs[250009];

ll sumN(ll &n) {
    return ((n * (n+1)) / 2) % m;
}

int main()

{
    ll n;
    sl(n), sl(m);

    if(n == 1) {
        pf("1\n");
        return 0;
    }

    fact[0] = 1;
    for1(i, n)
        fact[i] = (fact[i-1] * i) % m;

    ll ans = (fact[n] * n) % m;


    for(ll i = 2; i <= n; i++) {
        comb[i-1] = (fact[i] * fact[n-i] ) % m;
        comb[i-1] = (comb[i-1] * (n-i+1)) % m;
    }

    for(ll i = 1; i < n; i++) {
        cs[i] = (cs[i-1] + comb[i]) % m;
    }

    for(ll i = 1; i < n; i++) {
        ans = (ans + cs[n-i]) % m;
    }

    cout << ans << endl;

    return 0;
}