#include <bits/stdc++.h>  
using namespace std;

#define ll long long
#define P 1e9+7 

ll n,k,dp[33335];

vector<ll> fac;

ll fpow(ll a,ll b){
	ll c=1;
	for(;b;b>>=1,a=a*a%P)
		if(b&1) c=c*a%P;
	return c;
}

void work()
{
	ll ans=0;
	for(int x=0;x<fac.size();x++){
		dp[x]=fpow(k,(fac[x]+1)/2);
		for(int y=0;y<x;y++){
			if(fac[x]%fac[y]==0)
				dp[x]=(dp[x]-dp[y]+P)%P;
		}
		if(fac[x]%2) ans=(ans+dp[x]*fac[x]%P)%P
        else ans=(ans+dp[x]*fac[x]/2%P)%P;
	}
    cout<<ans<<endl;  
}

void init()
{
	fac.clear();
	for(ll i=1;i*i<=n;i++){
        if(n%i==0){
            fac.push_back(i);
            if(i*i!=n) fac.push_back(n/i);
        }
    }
    sort(fac.begin(),fac.end());
}

int main()
{
	while(cin>>n>>k) init(),work();
    return 0;
}