#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> Q;

const int inf = (int)1e9; 

ll gcd(ll a, ll b) {
	if (b > a) {
		ll tmp = b;
		b = a;
		a = tmp;
	}
	if (a%b == 0)return b;
	else return gcd(b, a%b);
}

ll inv(ll x,ll power) {
	ll res = 1;
	ll k = power;
	ll y = x%N;
	while (k) {
		if (k & 1)res = (res*y) % N;
		y = (y%N*y%N) % N;
		k /= 2;
	}
	return res;
}

int main(void){
	ll B,C,D;
	cin>>B>>C>>D;
	if(C==1){
		B = B%N;
		D = D%N;
		cout<<(B*D)%N<<endl;
		return 0;
	}
	if(C%N==0||C%N==1){
		ll X = inv(C,D);
		B = B%N;
		D = D%N;
		cout<<(B*D)%N<<endl;
	}
	else{
		ll X = inv(C,D);
		B = B%N;
		C = C%N;
		ll Y = inv(C,D);
		Y = (Y - C + N)%N;
		ll Z = inv(C-1,N-2);
		ll W = (X+(Y*Z)%N)%N;
		W = (W+N)%N;
		cout<<(B*W)%N<<endl;
	}
	return 0;
}