积性函数 + 快速幂
#include<bits/stdc++.h>
using namespace std;
typedef long long ll ;
double e = (sqrt(5) + 1) / 2;
const int mod = 1e9 + 7;
const int N = 1e7;
bool isprime[N + 7];
int prime[N + 7],ans, cnt, n, k, sum[N + 5];
ll qpow(ll s, ll k)
{
ll ans = 1 ;
while(k)
{
if(k & 1)
ans = ans * s % mod;
k >>= 1;
s = s * s % mod;
}
return ans ;
}
void init()
{
sum[1] = 1;
for(int i = 2 ; i <= n + 1; i ++)
{
if(!isprime[i])
prime[++cnt] = i,sum[i] = qpow(i,k);
for(int j = 1; j <= cnt && prime[j] * i <= n + 1; j++)
{
isprime[prime[j] * i] = 1;
sum[prime[j] * i] = sum[i] * 1ll * sum[prime[j]] % mod;
if(i % prime[j] == 0)
break;
}
}
}
int main()
{
cin >> n;
cin >> k;
init();
for(int i = 1 ; i <= n ; i++)
{
ans = (ans + 1LL * (n / i) *sum[i] ) % mod;
}
cout << ans << endl;
return 0;
}