#include<bits/stdc++.h>
#define IL inline
#define reg register
#define N 100000005
#define M 6000600
#define int long long
#define mod 1000000007
IL int read()
{
    reg int x=0,f=0; reg char ch=getchar();
    while(ch<'0'||ch>'9')f|=ch=='-',ch=getchar();
    while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
    return f?-x:x;
}

IL int Add(reg int x,reg int y){return x+y<mod?x+y:x+y-mod;}
IL int Sub(reg int x,reg int y){return x<y?x-y+mod:x-y;}
IL void Pls(reg int &x,reg int y){x=Add(x,y);}
IL void Pls(reg signed &x,reg int y){x=Add(x,y);}
IL void Dec(reg int &x,reg int y){x=Sub(x,y);}
IL int Mul(reg int x,reg int y){reg long long r=1ll*x*y; return r<mod?r:r%mod;}
IL int power(reg int x,reg int p){reg int r=1; for(;p;p>>=1,x=Mul(x,x))if(p&1)r=Mul(r,x); return r;}

const int inv2=mod+1>>1,B=1e8;
int n,m,pri[M],tot;
std::bitset<N>isp;

IL void sieve(reg int n)
{
    tot=0; 
    for(reg int i=2,j,v;i<=n;++i)
    {
        if(!isp[i])pri[++tot]=i;
        for(j=1;j<=tot&&(v=i*pri[j])<=n;++j)
        {
            isp[v]=1;
            if(i%pri[j]==0)break;
        }
    }
}

int ans0;
signed f0[N],g0[N];

IL void upd(reg int k0,reg int m)
{
    if(m<=B)Pls(f0[m],k0);
    else Pls(g0[n/m],k0);
}

void dfs(reg int i,reg int x,reg int f0)
{
    if(i>tot||pri[i]*pri[i]>x)
    {
        upd(f0,x);
        return;
    }
    dfs(i+1,x,f0);
    dfs(i+1,x/pri[i]/pri[i],mod-f0);
}

int c[M];
std::vector<std::tuple<int,int,int>>vec;

main()
{
    n=read(),m=read();
    reg int lim=1;
    while(lim*lim<=n)++lim;
    sieve(lim-1);
    vec.push_back({1,n,1});
    while(vec.size())
    {
        auto [i,x,f0]=vec.back();
        if(i>tot||pri[i]*pri[i]>x)
        {
            upd(f0,x),vec.pop_back();
            continue;
        }
        if(c[i]==2)
        {
            c[i]=0;
            vec.pop_back();
            continue;
        }
        if(c[i]==1)
        {
            c[i]=2;
            vec.push_back({i+1,x/pri[i]/pri[i],mod-f0});
        }else
        {
            c[i]=1;
            vec.push_back({i+1,x,f0});
        }
    }
    fprintf(stderr,"%.3lf\n",1.0*clock()/CLOCKS_PER_SEC);
    for(reg int x=1,m;x<=B;++x)if(f0[x])
    {
        m=x;
        reg int s0=0,i1=1,i2=2,i3=3,i4=4,i5=5,i6=6,i7=7,i8=8;
        while(i8*i8<=m)
        {
            s0+=m/i1,i1+=8;
            s0+=m/i2,i2+=8;
            s0+=m/i3,i3+=8;
            s0+=m/i4,i4+=8;
            s0+=m/i5,i5+=8;
            s0+=m/i6,i6+=8;
            s0+=m/i7,i7+=8;
            s0+=m/i8,i8+=8;
        }
        while(i1*i1<=m)s0+=m/i1,++i1;
        s0=(s0+s0-(i1-1)*(i1-1))%mod;
        Pls(ans0,Mul(s0,f0[x]));
    }
    for(reg int x=1,m;x<=B;++x)if(g0[x])
    {
        m=n/x;
        reg int s0=0,i1=1,i2=2,i3=3,i4=4,i5=5,i6=6,i7=7,i8=8;
        while(i8*i8<=m)
        {
            s0+=m/i1,i1+=8;
            s0+=m/i2,i2+=8;
            s0+=m/i3,i3+=8;
            s0+=m/i4,i4+=8;
            s0+=m/i5,i5+=8;
            s0+=m/i6,i6+=8;
            s0+=m/i7,i7+=8;
            s0+=m/i8,i8+=8;
        }
        while(i1*i1<=m)s0+=m/i1,++i1;
        s0=(s0+s0-(i1-1)*(i1-1))%mod;
        Pls(ans0,Mul(s0,g0[x]));
    }
    printf("%lld\n",power(ans0,2));
    fprintf(stderr,"%.3lf\n",1.0*clock()/CLOCKS_PER_SEC);
}