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

    numerator = 1
    denominator = 1

    for i in range(1, r + 1):
        numerator = (numerator * (n - r + i)) % p
        denominator = (denominator * i) % p

    return (numerator * pow(denominator, p - 2, p)) % p