#include<bits/stdc++.h>
typedef long long i64;
const int P=1e9+7;
struct factor{
	int x,t,v;
	bool operator<(const factor&w)const{return x<w.x;}
}fs[3007];
int n,k,fp=0,ans=0;
void chk(int x){
	if(n&1)fs[fp++]=(factor){x,x+1>>1};
	else if(1&~(n/x))fs[fp++]=(factor){x,x};
}
int pw(int a,int n){
	int v=1;
	for(;n;n>>=1,a=i64(a)*a%P)if(n&1)v=i64(v)*a%P;
	return v;
}
int main(){
	scanf("%d%d",&n,&k);
	for(int i=1;i*i<=n;++i)if(n%i==0){
		chk(i);
		if(i*i!=n)chk(n/i);
	}
	std::sort(fs,fs+fp);
	for(int i=0;i<fp;++i){
		fs[i].v=pw(k,fs[i].t);
		for(int j=0;j<i;++j)if(fs[i].x%fs[j].x==0){
			(fs[i].v-=fs[j].v)%=P;
		}
		ans=(ans+fs[i].v*i64(fs[i].x))%P;
	}
	printf("%d\n",(ans+P)%P);
	return 0;
}