#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define int long long
int MOD = 1000000007;
int p(int a, int b) {
	if (b == 2)return a*a%MOD;
	if (b == 1)return a;
	if (b == 0) return 1;
	if (b % 2 == 0) {
		return  p(p(a, b / 2), 2);
	}
	else {
		return  ((p(p(a, b / 2), 2) % MOD) * a) % MOD;
	}
}
signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int B, C, D;
	cin >> B >> C >> D;
	int res;
	if (C == 1) {
		res = (B%MOD)*(D%MOD) % MOD;
	}
	else {
		//cerr << p(2, 3) << endl;
		B %= MOD;
		C %= MOD;
		int X = (B*C) % MOD;
		//cerr << p((1 - C + 2 * MOD) % MOD, MOD - 2) * (MOD+1-C)%MOD << endl;
		X = (X*p((1 - C + 2 * MOD) % MOD, MOD - 2)) % MOD;
		//cerr << X << endl;
		res = (MOD - ((X * p(C, D)) % MOD)) % MOD;
		res = (res + X) % MOD;
	}
	cout << res << endl;
}