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

const int mod=1000000007;
typedef long long ll;
int ksm(ll a,int b,int c=1){
	for(;b;b/=2,a=a*a%mod)
		if(b&1)c=c*a%mod;
	return c;
}

inline void reduce(int&x){x+=x>>31&mod;}
int n,K,ans;
vector<pair<int,int> >factor(int n){
	vector<pair<int,int> >ret;
	for(int i=1;i*i<=n;++i)if(n%i==0)ret.emplace_back(i,0),ret.emplace_back(n/i,0);
	sort(ret.begin(),ret.end());
	return ret;
}

int main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>n>>K;
	auto vec=factor(n);
	for(auto&i:vec){
		int res=ksm(K,(i.first+1)/2);
		for(auto j:vec)if(i.first%j.first==0)reduce(res-=j.second);
		i.second=res;res=(ll)res*i.first/(2-(i.first&1))%mod;
		reduce(ans+=res-mod);
	}
	cout<<ans<<'\n';
	return 0;
}
