Spare Tire



#include<bits/stdc++.h>
#define me(a,x) memset(a,x,sizeof(a))
#define IN freopen("in.txt","r",stdin);
#define OUT freopen("out.txt","w",stdout);
#define sc scanf
#define itn int
#define STR clock_t startTime = clock();
#define END clock_t endTime = clock();cout << double(endTime - startTime) / CLOCKS_PER_SEC *1000<< "ms" << endl;
using namespace std;
const int N=1e8+5;
const long long mod=1e9+7;
const long long mod2=998244353;
const int inv6=166666668;
const int inv2=mod+1>>1;
const int oo=0x7fffffff;
const int sup=0x80000000;
typedef long long ll;
typedef unsigned long long ull;
template <typename it>void db(it *begin,it *end){while(begin!=end)cout<<(*begin++)<<" ";puts("");}
template <typename it>
string to_str(it n){string s="";while(n)s+=n%10+'0',n/=10;reverse(s.begin(),s.end());return s;}
template <typename it>int o(it a){cout<<a<<endl;return 0;}
inline ll mul(ll a,ll b,ll c){ll ans=0;for(;b;b>>=1,a=(a+a)%c)if(b&1)ans=(ans+a)%c;return ans;}
inline ll ksm(ll a,ll b,ll c){ll ans=1;for(;b;b>>=1,a=mul(a,a,c))if(b&1)ans=mul(ans,a,c);return ans;}
inline void exgcd(ll a,ll b,ll &x,ll &y){if(!b)x=1,y=0;else exgcd(b,a%b,y,x),y-=x*(a/b);}
ll g(ll x){return 1LL*x*(x+1)%mod*inv2%mod;}
ll f(ll x){return 1LL*x*(x+1)%mod*(2LL*x+1)%mod*inv6%mod;}
int n,m;
vector<int>dis;
vector<int>mu;
int main(){
    while(~sc("%d%d",&n,&m)){
    dis.clear();mu.clear();
    for(int i=1;1LL*i*i<=m;i++){
        if(m%i==0){
            dis.push_back(i);
            if(i!=m/i)dis.push_back(m/i);
        }
    }
    sort(dis.begin(),dis.end());
    int sz=dis.size();
    for(int i=0;i<sz;i++){
        int x=dis[i];
        if(x==1){
            mu.push_back(1);continue;
        }
        int flag=0,cnt=0;
        for(int j=2;1LL*j*j<=x;j++){
            if(x%j==0){
                if(x%(1LL*j*j)==0){
                    flag=1;break;
                }
                cnt++;x/=j;
            }
        }
        if(flag){
            mu.push_back(0);
        }else{
            if(x>1)cnt++;
            if(cnt&1)mu.push_back(-1);
            else mu.push_back(1);
        }
    }
    ll ans=0;
    for(int i=0;i<sz;i++){
        ll x=1LL*dis[i]*dis[i]%mod*f(n/dis[i])%mod;
        x=(x*mu[i]+mod)%mod;
        ll y=1LL*dis[i]*g(n/dis[i])%mod;
        y=(y*mu[i]+mod)%mod;
        x=(x+y)%mod;
        ans=(ans+x)%mod;
    }
    printf("%lld\n",(ans+mod)%mod);
   }
}