#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define mod 1000000007
int n,k,p,i;
int bidmod(int x,int y) {
int s=1;
for(; y; y>>=1,x=1LL * x * x % mod)if(y&1)s=1LL * s*x%mod;
return s;
}
int main() {
cin>>n>>k>>p;
LL ans;
if(k==1) ans = (1LL * n*(n-1)/2%mod*p+n)%mod;
else {
i=bidmod(k-1,mod-2);
ans=((1+1LL * p*i)%mod*(bidmod(k,n)-1)%mod*i-1LL * p*n%mod*i%mod+mod)%mod;
}
printf("%lld\n",ans);
return 0;
}