#include<iostream>
#include<cstdio>
#include<cmath>
#include<unordered_map>
#define N 1000000
#define mod 1000000007
using namespace std;
long long read()
{
	char c=0;
	long long sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
void Adder(int &x,int d)
{
	x=x+d>=mod?x+d-mod:x+d;
	return;
}
void Adder2(int &x,int d)
{
	x=x+d<0?x+d+mod:x+d;
	return;
}
int MD(int x)
{
	return x>=mod?x-mod:x;
}
int MD2(int x)
{
	return x<0?x+mod:x;
}
long long n;
int sn,m,d,ans,ans2,sd[N+1],tong[N+1],length,miu[N+1],delta[N+1],smiu[N+1],sdelta[N+1];
bool nprime[N+1];
int get_sqrt(long long x)
{
	int sx=sqrt(x);
	while (1ll*(sx+1)*(sx+1)<=x) ++sx;
	while (1ll*sx*sx>x) --sx;
	return sx;
}
int get_cbrt(long long x)
{
	int sx=pow(x,1.0/3);
	while (1ll*(sx+1)*(sx+1)*(sx+1)<=x) ++sx;
	while (1ll*sx*sx*sx>x) --sx;
	return sx;
}
struct reads
{
	long long x,y;
};
reads P,L,R,stk[N+1];
int top;
reads operator + (reads a,reads b)
{
	return (reads){a.x+b.x,a.y+b.y};
}
bool check(long long x,reads d)
{
	return x<1ll*d.x*d.y;
}
bool check2(long long x,long long y,reads d)
{
	return (__int128)(x)*d.x<=(__int128)(y)*y*d.y;
}
int calc(long long x)
{
	if (x<=N) return sd[x];
	long long d=get_sqrt(x),d2=get_cbrt(x),ans=0;
	top=0,P=(reads){x/d,d+1},stk[++top]=(reads){1,0},stk[++top]=(reads){1,1};
	while (1)
	{
		L=stk[top--];
		while (check(x,(reads){P.x+L.x,P.y-L.y})) ans+=(__int128)(P.x)*L.y+(((__int128)(L.y+1)*(L.x-1))>>1),P.x+=L.x,P.y-=L.y;
		if(P.y<=d2) break;
		R=stk[top];
		while (!check(x,(reads){P.x+R.x,P.y-R.y})) L=R,R=stk[--top];
		while (1)
		{
			reads mid=L+R;
			if (check(x,(reads){P.x+mid.x,P.y-mid.y})) R=stk[++top]=mid;
			else if(check2(x,P.x+mid.x,R)) break;
			else L=mid;
		}
	}
	for (int i=1;i<P.y;++i) ans+=x/i;
	return (ans*2-d*d)%mod;
}
int calc2(long long x)
{
	__int128 res=0;
	int d=get_sqrt(x);
	for (int i=1;i<=d;++i) res+=(((__int128)(x/i)*(x/i+1)*i)>>1);
	return (2*res-((((__int128)(d)*d*(d+1)*(d+1)))>>2))%mod;
}
unordered_map<int,int>dp;
unordered_map<int,int>dp2;
int S2(int x)
{
	return ((__int128)(x)*(x+1)*((x<<1)+1)/6)%mod;
}
int solve(int x)
{
	if (x<=N) return smiu[x];
	if (dp.find(x)!=dp.end()) return dp[x];
    long long res=1;
	for (int i=2,lst;i<=x;i=lst+1) lst=x/(x/i),res-=1ll*solve(x/i)*(lst-i+1);
	res=MD2(res%mod),dp[x]=res;
	return res;
}
int solve2(int x)
{
	if (x<=N) return sdelta[x];
	if (dp2.find(x)!=dp2.end()) return dp2[x];
	__int128 res=1;
	for (int i=2,lst;i<=x;i=lst+1) lst=x/(x/i),res-=1ll*solve2(x/i)*(S2(lst)-S2(i-1));
	res=MD2(res%mod),dp2[x]=res;
	return res;
}
int main()
{
	n=read(),m=read(),sn=get_sqrt(n);
	for (int i=1;i<=N;++i) miu[i]=delta[i]=1;
	for (int i=2;i<=N;++i)
		if (!nprime[i])
		{
			miu[i]=mod-1,delta[i]=MD2(-1ll*i*i%mod);
			for (int j=(i<<1);j<=N;j+=i)
			{
				nprime[j]=1,miu[j]=MD2(-miu[j]),delta[j]=MD2(-1ll*delta[j]*i%mod*i%mod);
				if ((j/i)%i==0) miu[j]=delta[j]=0;
			}
		}
	for (int i=1;i<=N;++i) smiu[i]=MD(smiu[i-1]+miu[i]),sdelta[i]=MD(sdelta[i-1]+delta[i]);
	for (int i=1;i<=N;++i)
		for (int j=i;j<=N;j+=i)
			sd[j]++;
	for (int i=2;i<=N;++i) sd[i]+=sd[i-1];
	for (long long i=1,d,lst;i<=sn;i=lst+1) d=n/(i*i),lst=get_sqrt(n/d),Adder(ans,1ll*MD2(solve(lst)-solve(i-1))*calc(d)%mod);
	if (!m)
	{
		printf("%lld\n",1ll*ans*ans%mod);
		return 0;
	}
	for (long long i=1,d,lst;i<=sn;i=lst+1) d=n/(i*i),lst=get_sqrt(n/d),Adder(ans2,1ll*MD2(solve2(lst)-solve2(i-1))*calc2(d)%mod);
	printf("%lld %lld\n",1ll*ans*ans%mod,1ll*ans2*ans2%mod);
	return 0;
}