拓展Lucas

#include <cstdio>

using namespace std;
#define int long long
int P[50], D[50], cnt = 0, B[50];

int Power(int q, int n, int mod) {
    if (n == 0)return 1;
    if (q == 0)return 0;
    int res = Power(q * q % mod, n / 2, mod);
    if (n & 1)res *= q;
    return res % mod;
}

int Extend_Gcd(int a, int b, int &x, int &y) {
    if (b == 0) {
        x = 1, y = 0;
        return a;
    }
    int d = Extend_Gcd(b, a % b, x, y);
    int z = x;
    x = y;
    y = z - y * (a / b);
    return d;
}

int Linear_Congruence_Equation(int a, int b, int m) {//a * x == b (mod m)
    int x = 0, y = 0;
    int d = Extend_Gcd(a, m, x, y);
    return (((x * (b / d)) % m) + m) % m;
}

int f(int n, int p, int mod) {//mod = p^k
    if (n == 0)return 1 % mod;
    int x = 1;
    for (int i = 1; i <= mod; i++) {
        if (i % p != 0) {
            x *= i;
            x %= mod;
        }
    }
    x = Power(x, n / mod, mod);
    int y = 1;
    for (int i = (n / mod) * mod; i <= n; i++) {
        if (i % p != 0) {
            y *= i % mod;
            y %= mod;
        }
    }
    return f(n / p, p, mod) * x % mod * y % mod;
}

int g(int n, int p) {
    if (n < p)return 0;
    return g(n / p, p) + (n / p);
}

int Extend_Lucas(int n, int m, int p) {
    int M = p;
    for (int i = 2; i * i <= p; i++) {
        if (p % i == 0) {
            cnt++;
            P[cnt] = i;
            D[cnt] = 1;
            while (p % i == 0)D[cnt] *= i, p /= i;
        }
    }
    if (p != 1) {
        cnt++;
        P[cnt] = p, D[cnt] = p;
    }
    for (int i = 1; i <= cnt; i++) {
        B[i] = 1;
        B[i] *= f(n, P[i], D[i]);
        int b = f(m, P[i], D[i]) * f(n - m, P[i], D[i]);
        B[i] *= Linear_Congruence_Equation(b % D[i], 1, D[i]);
        B[i] %= D[i];
        int G = g(n, P[i]) - g(m, P[i]) - g(n - m, P[i]);
        B[i] *= Power(P[i] % D[i], G, D[i]);
        B[i] %= D[i];
    }
    int ans = 0;
    for (int i = 1; i <= cnt; i++) {
        int t = Linear_Congruence_Equation(M / D[i], 1, D[i]);
        ans += (M / D[i]) * B[i] * t;
        ans %= M;
    }
    return ans;
}

signed main() {
    int n, m, p;
    scanf("%lld %lld %lld", &n, &m, &p);
    printf("%lld\n", Extend_Lucas(n, m, p));
    return 0;
}