本题用等比数列求和公式
Sn=(a1(qn -1))/(q-1);
用乘法逆元求除法意义上的取模运算
快速幂计算;
#include <iostream>
#include <cstdio>
#define LL long long
using namespace std;
const LL MOD=1e9+7;
LL n,m,ans;
LL ksm(LL x,LL y)
{
LL tmp=1;
while(y){
if(y%2) tmp=tmp*x%MOD;
x=x*x%MOD;
y/=2;
}
return tmp;
}
int main()
{
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
cin>>n>>m;ans=m;
for(int i=2;i<=n;i++){
ans=(ans+i*(ksm(i,m)-1)%MOD*ksm(i-1,MOD-2)%MOD)%MOD;
}
printf("%lld",ans);
return 0;
}