#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
constexpr int p=1e9+7,N=1e8;
constexpr long long lim=9e18-1ll*p*p;
void red(long long&v){if(v>lim||v<-lim)v%=p;}
int mu[N+1];
bitset<N+10>ck;
int pe[3400];
void init(int N)
{
	mu[1]=1;
	int sum=0;
    for(int x=2;x<=N;x++)
    {
		if(!ck[x])pe[++sum]=x,mu[x]=-1;
		while(sum>0&&1ll*x*pe[sum]>N)sum--;
    	for(int j=1;1ll*x*pe[j]<=N;j++)
    	{
    		ck.set(x*pe[j]);
    		if(x%pe[j]==0)break;
    		mu[x*pe[j]]=-mu[x];
    	}
    }
}
void calc12(long long&v1,long long &v2,long long n)
{
	v1=v2=0;
	for(int x=1;1ll*x*x<=n;x++)
	v1+=n/x,red(v2+=x*(n/x)%p*((n/x+1)%p));
	v1=v1*2;
	int s=sqrt(n);
	v1=(v1-1ll*s*s)%p;
	int vv=1ll*s*(s+1)/2%p;
	vv=1ll*vv*vv%p;
	v2=v2%p-vv;
}
namespace divcnt1
{
const int N=1000005;
typedef long long ll;
struct qwq {
	ll x, y;
	qwq (ll x0 = 0, ll y0 = 0) : x(x0), y(y0) {}
	inline qwq operator + (const qwq &B) const {return qwq(x + B.x, y + B.y);}
};
ll n;
int top;
qwq stk[N];
inline void push(qwq x) { stk[++top]=x;}
inline bool check(ll x, ll y) {return n < x * y;}

inline bool judge(ll x, qwq v) {return (__int128)n * v.x <= (__int128)x * x * v.y;}

long long S1() {
	int i, crn = cbrt(n);
	ll srn = sqrt(n), x = n / srn, y = srn + 1;
	long long ret = 0;
	qwq L, R, M;
	push(qwq(1, 0)); push(qwq(1, 1));
	while(true) {
		for (L = stk[top--]; check(x + L.x, y - L.y); x += L.x, y -= L.y)
			ret += x * L.y + (L.y + 1) * (L.x - 1) / 2;
		if (y <= crn) break;
		for (R = stk[top]; !check(x + R.x, y - R.y); R = stk[--top]) L = R;
		for (; M = L + R, 1; )
			if (check(x + M.x, y - M.y)) push(R = M);
			else {
				if (judge(x + M.x, R)) break;
				L = M;
			}
	}
	for (i = 1; i < y; ++i) ret += n / i;
	return ret*2-srn*srn;
}
}
void calc1(long long&v1,long long n)
{
	divcnt1::n=n;
	v1=divcnt1::S1()%p;
}
main()
{
	cin.tie(0)->sync_with_stdio(0);
	long long n;
	int m;
	cin>>n>>m;
	init(__builtin_sqrtl(n));
	if(!m)
	{
		long long ans=0,v1=0;
		long long lst=0;
		for(int x=1;1ll*x*x<=n;x++)
		if(mu[x])
		{
			if(n/(1ll*x*x)!=lst)
			{
				lst=n/(1ll*x*x);
				calc1(v1,lst);
			}
			red(ans+=mu[x]*v1);
		}
		ans%=p;
		ans=1ll*ans*ans%p;
		cout<<(ans+p)%p;
		return 0;
	}
	long long ans=0,ans2=0,v1=0,v2=0;
	long long lst=0;
	for(int x=1;1ll*x*x<=n;x++)
	if(mu[x])
	{
		if(n/(1ll*x*x)!=lst)
		{
			lst=n/(1ll*x*x);
			calc12(v1,v2,lst);
		}
		//cout<<lst<<','<<v1<<','<<v2<<endl;
		red(ans+=mu[x]*v1);
		red(ans2+=1ll*mu[x]*x*x%p*v2);
	}
	ans%=p;
	ans2%=p;
	ans=1ll*ans*ans%p;
	ans2=1ll*ans2*ans2%p;
	cout<<(ans+p)%p;
	if(m)cout<<' '<<(ans2+p)%p<<endl;
}