#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
ll pow(ll x,ll y){
  if(y==0) return 1;
  ll res=pow(x,y/2);
  res*=res;
  res%=mod;
  if(y%2==1) res*=x;
  return res%mod;
}
ll ans[100005]={0};
int main(){
  ll n,k;
  cin>>n>>k;
  ll res=0;
  for(ll m=k;m>=1;m--){
    ll a1=pow(k/m,n);
    for(ll i=2*m;i<=k;i+=m){
      a1-=ans[i];
      a1+=mod;
      a1%=mod;
    }
    ans[m]=a1;
    res+=a1*m;
    res%=mod;
  }
  cout<<res<<endl;
}
