def ncr_modp(n, r, p):
    if p == 1:
        return 0
    if r < 0 or r > n:
        return 0
    r = min(r, n - r)
    if r == 0:
        return 1 % p

    if p > n:
        numer = 1
        denom = 1
        start = n - r + 1
        for x in range(start, n + 1):
            numer = (numer * (x % p)) % p
        for x in range(1, r + 1):
            denom = (denom * x) % p
        return (numer * pow(denom, p - 2, p)) % p

    fact = [1] * p
    for i in range(1, p):
        fact[i] = (fact[i - 1] * i) % p

    def ncr_small_mod_prime(ni, ri):
        if ri > ni:
            return 0
        denom = (fact[ri] * fact[ni - ri]) % p
        return (fact[ni] * pow(denom, p - 2, p)) % p

    result = 1
    while n > 0 or r > 0:
        ni = n % p
        ri = r % p
        if ri > ni:
            return 0
        result = (result * ncr_small_mod_prime(ni, ri)) % p
        n //= p
        r //= p
    return result