#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=1e8+5,M=3.3e7+5,K=1000+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
ll n,k;int m;
bitset<N> flag;
char mu[N];
int pr[N/10],ph;
void init(){
	mu[1]=1;
	for(int i=2;i<=k;i++){
		if(!flag[i]) pr[++ph]=i,mu[i]=-1;
		for(int j=1;j<=ph&&i*pr[j]<=k;j++){
			flag[i*pr[j]]=1;
			if(i%pr[j]==0) break;
			mu[i*pr[j]]=-mu[i];
		}
	}
}


using cp=complex<ll>;using LL=__int128;
cp pt;int lim;
ll tot1,tot2,ans1,ans2;
void calc(cp l,cp r,ll n){
	// gdb(pt.real(),pt.imag());
	if(pt.imag()<=lim) return;
	cp mid=l+r;
	cp p=pt+mid;
	if(p.imag()>n/p.real()) calc(l,mid,n);
	while(1){
		p=pt+mid;
		if(p.imag()>n/p.real()){
			tot1+=(pt.real()+p.real()-1)*(-mid.imag()+1)/2-pt.real();
			pt+=mid;
		}else break;
	}
	if(LL(r.imag())*p.real()*p.real()>=-LL(n)*r.real()) calc(mid,r,n);
}

void Solve(){
	scanf("%lld%d",&n,&m);
	k=sqrtl(n);
	init();
	ll Ld=n+1;
	for(int i=1;1ll*i*i<=n;i++)if(mu[i]){
		ll d=n/i/i;
		if(d^Ld){
			Ld=d;int k=sqrtl(d);
			tot1=0;lim=powl(d,1.0/3);
			pt=cp(d/k,k+1);calc(cp(0,-1),cp(1,0),d);
			/*for(int j=1;j<=kk;j++){
				ll k=d/j%mod;
				tot1+=k*2;
			}*/
			for(int i=1;i<pt.imag();i++) tot1+=d/i;
			tot1=tot1*2-1ll*k*k;

			if(m){
				tot2=-(1ll*(k+1)*k/2%mod)*(1ll*(k+1)*k/2%mod);
				for(int j=1;j<=k;j++){
					ll k=d/j%mod;
					tot2+=k*(k+1)%mod*j%mod;
				}
			}
		}
		ans1+=tot1*mu[i];
		if(m) ans2+=tot2%mod*mu[i]*i%mod*i%mod;
	}
	ans1=(ans1%mod+mod)%mod;
	if(m) ans2=(ans2%mod+mod)%mod;
	printf("%lld ",ans1*ans1%mod);
	if(m) printf("%lld\n",ans2*ans2%mod);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}