#include<cstdio>

 #include<algorithm>

 #include<cstring>

 #include<vector>

 using namespace std;

 #define fi first

 #define se second

 #define mp make_pair

 #define pb push_back

 typedef long long ll;

 typedef unsigned long long ull;

 typedef pair<int,int> pii;

 #define N 10000010

 #define md 1000000007

 bool nprime[N+];int prime[N+],len;

 ll A[N+],ans,n,k;

 ll poww(ll a,ll b)

 {

     ll base=a,ans=;

     while(b)

     {

         if(b&) ans=ans*base%md;

         base=base*base%md;

         b>>=;

     }

     return ans;

 }

 int main()

 {

     ll i,j;

     scanf("%lld%lld",&n,&k);

     A[]=;

     for(i=;i<=n;i++)

     {

         if(!nprime[i])    prime[++len]=i,A[i]=poww(i,k);

         for(j=;j<=len&&i*prime[j]<=n;j++)

         {

             nprime[i*prime[j]]=;

             A[i*prime[j]]=A[i]*A[prime[j]]%md;

             if(i%prime[j]==)    break;

         }

     }

     for(i=;i<=n;i++)    ans=(ans+A[i]*(n/i)%md)%md;

     printf("%lld",ans);

     return ;

 }