CodeForces - 622F：The Sum of the k-th Powers （拉格朗日插值法求自然数幂和）

There are well-known formulas: , , . Also mathematicians found similar formulas for higher degrees.

Find the value of the sum  modulo 10⁹ + 7 (so you should find the remainder after dividing the answer by the value 10⁹ + 7).

Input

The only line contains two integers n, k (1 ≤ n ≤ 10⁹, 0 ≤ k ≤ 10⁶).

Output

Print the only integer a — the remainder after dividing the value of the sum by the value 10⁹ + 7.

Examples

Input

4 1

Output

10

Input

4 2

Output

30

Input

4 3

Output

100

Input

4 0

Output

4

就是抄个板子在这里。

#include<bits/stdc++.h>
#define ll long long
const int maxn=;
const int mod=;
using namespace std;
ll f[maxn],fac[maxn],inv[maxn];
ll P(ll a,ll b)
{
    ll ans=;
    while(b) {
        if(b&) ans=ans*a%mod;
        b>>=; a=a*a%mod;
    }
    if(ans<) ans+=mod;
    return ans;
}
void init(int tot)
{
    fac[]=;
    for(int i=;i<=tot;i++)
        fac[i]=fac[i-]*i%mod;
    inv[tot]=P(fac[tot],mod-);
    inv[]=; //求阶乘逆元
    for(int i=tot-;i>=;i--)
        inv[i]=inv[i+]*(i+)%mod;
}
ll Lagrange(ll n,ll k)
{
    int tot=k+;
    init(tot);
    ll ans=,now=;
    for(int i=;i<=tot;i++) now=now*(n-i)%mod;
    for(int i=;i<=tot;i++) {
        ll inv1=P(n-i,mod-);
        ll inv2=inv[i-]*inv[tot-i]%mod;
        if((tot-i)&) inv2=mod-inv2;
        ll temp=now*inv1%mod;
        temp=temp*f[i]%mod*inv2%mod;
        ans+=temp;
        if(ans>=mod) ans-=mod;
    }
    return ans;
}
int main()
{
    ll n,k;
    cin>>n>>k;
    for(int i=;i<=k+;i++) f[i]=(f[i-]+P(i,k))%mod;
    if(n<=k+) cout<<f[n]<<endl;
    else cout<<Lagrange(n,k+)<<endl;
    return ;
}