#include <bits/stdc++.h>

using std::sort;

const int N=1e5+10,Mod=1e9+7;

int n,k,que[N],dp[N];

void Init() {
	scanf("%d%d",&n,&k);
}

int pow(int x,int t) {
	int ret=1;
	while (t) {
		if (t&1) ret=1ll*ret*x%Mod;
		x=1ll*x*x%Mod;
		t=t>>1;
	}
	return ret;
}

void Solve() {
	int top=0;
	for (int i=1;i*i<=n;++i) {
		if (n%i) continue;
		que[++top]=i;
		if (i*i==n) continue;
		que[++top]=n/i;
	}
	sort(que+1,que+top+1);
	
	int ans=0;
	for (int i=1;i<=top;++i) {
		dp[i]=pow(k,(que[i]+1)>>1);
		for (int j=1;j<i;++j) if (que[i]%que[j]==0) {
			dp[i]=(dp[i]-dp[j]+Mod)%Mod;
		}
		if (que[i]&1) ans=(ans+1ll*dp[i]*que[i]%Mod)%Mod;
		else ans=(ans+1ll*dp[i]*que[i]/2%Mod)%Mod;
	}
	
	printf("%d\n",ans);
}

int main() {
	Init();
	Solve();
	return 0;
}