---------------------------快速幂
#define long long ll
#define mod 1e9+7
ll quickpow(ll a,ll n){
if(n==0||a==1)return 1;
ll ans=1;
while(n!=){
if(n%2==1)ans=a*ans%mod;
a=a*a%mod;
n>>1;
}
return ans;
}
---------------------------