快速幂

ll quickPower(ll p, ll q)
{
    ll ans = 1, base = p;
    while(q > 0)
    {
        if(q & 1){
            ans *= base;
            ans %= mod;
        }
        base *= base;
        base %= mod;
        q >>= 1;
    }
    return ans;
}