#include using namespace std; template class y_combinator { F f; public: y_combinator(F&& f) : f(std::forward(f)) {} template auto operator()(Args&&... args) const { return f(*this, std::forward(args)...); } }; using ll = long long; using ld = long double; template > using prique = std::priority_queue, U>; template T floor(T a, T b) noexcept { return a / b - (a % b && (a ^ b) < 0); } template T ceil(T a, T b) noexcept { return floor(a + b - 1, b); } template bool chmin(T& x, const T& y) noexcept { return (x > y ? x = y, true : false); } template bool chmax(T& x, const T& y) noexcept { return (x < y ? x = y, true : false); } #define overload4(a, b, c, d, e, ...) e #define rep1(a) for (long long _i = 0; _i < (a); _i++) #define rep2(i, a) for (long long i = 0; i < (a); i++) #define rep3(i, a, b) for (long long i = (a); i < (b); i++) #define rep4(i, a, b, c) for (long long i = (a); i < (b); i += (c)) #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep(i, a, b, c) for (long long i = (a); i > (b); i += (c)) #define all(x) std::begin(x), std::end(x) #define rall(x) std::rbegin(x), std::rend(x) #define pb push_back #ifndef LOCAL #define debug(...) #endif const int md = 1e9 + 7; using S = array, 2>; S op(S a, S b) { S e{}; rep(i, 2) rep(k, 2) rep(j, 2) { e[i][j] += a[i][k] * b[k][j]; e[i][j] %= md; } return e; } S pow(S a, ll n) { S e{}; rep(i, 2) e[i][i] = 1; while (n) { if (n & 1) e = op(e, a); a = op(a, a); n >>= 1; } return e; } void run_case() { ll B, C, D; cin >> B >> C >> D; B %= md, C %= md; S a{}; const ll BC = (B * C) % md; a[0][0] = C, a[0][1] = BC, a[1][0] = 0, a[1][1] = 1; a = pow(a, D - 1); ll ans = a[0][0] * BC; ans %= md; ans += a[0][1]; ans %= md; cout << ans << endl; } int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); std::fixed(std::cout).precision(16); int T = 1; // cin >> T; while (T--) run_case(); return 0; }